./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/ntdrivers-simplified/floppy_simpl4.cil-2.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 57096758 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e01e5a5b-1932-41cb-a6fe-ecb6f7d04a98/bin/uautomizer-hJ6jxDFKc3/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e01e5a5b-1932-41cb-a6fe-ecb6f7d04a98/bin/uautomizer-hJ6jxDFKc3/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e01e5a5b-1932-41cb-a6fe-ecb6f7d04a98/bin/uautomizer-hJ6jxDFKc3/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e01e5a5b-1932-41cb-a6fe-ecb6f7d04a98/bin/uautomizer-hJ6jxDFKc3/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/ntdrivers-simplified/floppy_simpl4.cil-2.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e01e5a5b-1932-41cb-a6fe-ecb6f7d04a98/bin/uautomizer-hJ6jxDFKc3/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e01e5a5b-1932-41cb-a6fe-ecb6f7d04a98/bin/uautomizer-hJ6jxDFKc3 --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 3dcfb71b16f6783353008d1be8597dab2a9bd20e ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.2.1-dev-5709675 [2021-10-15 19:34:54,850 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-10-15 19:34:54,853 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-10-15 19:34:54,891 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-10-15 19:34:54,892 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-10-15 19:34:54,893 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-10-15 19:34:54,896 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-10-15 19:34:54,899 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-10-15 19:34:54,902 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-10-15 19:34:54,903 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-10-15 19:34:54,905 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-10-15 19:34:54,907 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-10-15 19:34:54,907 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-10-15 19:34:54,909 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-10-15 19:34:54,911 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-10-15 19:34:54,914 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-10-15 19:34:54,915 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-10-15 19:34:54,917 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-10-15 19:34:54,920 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-10-15 19:34:54,924 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-10-15 19:34:54,926 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-10-15 19:34:54,936 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-10-15 19:34:54,938 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-10-15 19:34:54,940 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-10-15 19:34:54,945 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-10-15 19:34:54,945 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-10-15 19:34:54,946 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-10-15 19:34:54,954 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-10-15 19:34:54,955 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-10-15 19:34:54,957 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-10-15 19:34:54,957 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-10-15 19:34:54,959 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-10-15 19:34:54,960 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-10-15 19:34:54,961 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-10-15 19:34:54,965 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-10-15 19:34:54,967 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-10-15 19:34:54,968 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-10-15 19:34:54,968 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-10-15 19:34:54,969 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-10-15 19:34:54,970 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-10-15 19:34:54,971 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-10-15 19:34:54,973 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e01e5a5b-1932-41cb-a6fe-ecb6f7d04a98/bin/uautomizer-hJ6jxDFKc3/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2021-10-15 19:34:55,030 INFO L113 SettingsManager]: Loading preferences was successful [2021-10-15 19:34:55,034 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-10-15 19:34:55,035 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-10-15 19:34:55,035 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-10-15 19:34:55,038 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-10-15 19:34:55,038 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-10-15 19:34:55,038 INFO L138 SettingsManager]: * Use SBE=true [2021-10-15 19:34:55,039 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-10-15 19:34:55,039 INFO L138 SettingsManager]: * sizeof long=4 [2021-10-15 19:34:55,039 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2021-10-15 19:34:55,040 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-10-15 19:34:55,040 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-10-15 19:34:55,040 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-10-15 19:34:55,053 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2021-10-15 19:34:55,053 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2021-10-15 19:34:55,054 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2021-10-15 19:34:55,054 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-10-15 19:34:55,054 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2021-10-15 19:34:55,054 INFO L138 SettingsManager]: * sizeof long double=12 [2021-10-15 19:34:55,055 INFO L138 SettingsManager]: * Use constant arrays=true [2021-10-15 19:34:55,055 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-10-15 19:34:55,055 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-10-15 19:34:55,055 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-10-15 19:34:55,056 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-10-15 19:34:55,056 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-10-15 19:34:55,056 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-10-15 19:34:55,056 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-10-15 19:34:55,057 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-10-15 19:34:55,057 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-10-15 19:34:55,057 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_e01e5a5b-1932-41cb-a6fe-ecb6f7d04a98/bin/uautomizer-hJ6jxDFKc3/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_e01e5a5b-1932-41cb-a6fe-ecb6f7d04a98/bin/uautomizer-hJ6jxDFKc3 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 -> 3dcfb71b16f6783353008d1be8597dab2a9bd20e [2021-10-15 19:34:55,428 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-10-15 19:34:55,456 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-10-15 19:34:55,459 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-10-15 19:34:55,461 INFO L271 PluginConnector]: Initializing CDTParser... [2021-10-15 19:34:55,462 INFO L275 PluginConnector]: CDTParser initialized [2021-10-15 19:34:55,464 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e01e5a5b-1932-41cb-a6fe-ecb6f7d04a98/bin/uautomizer-hJ6jxDFKc3/../../sv-benchmarks/c/ntdrivers-simplified/floppy_simpl4.cil-2.c [2021-10-15 19:34:55,539 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e01e5a5b-1932-41cb-a6fe-ecb6f7d04a98/bin/uautomizer-hJ6jxDFKc3/data/e571d9211/4267e1908eba437699ecb3e0504f5b15/FLAGa903c1b4c [2021-10-15 19:34:56,234 INFO L306 CDTParser]: Found 1 translation units. [2021-10-15 19:34:56,234 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e01e5a5b-1932-41cb-a6fe-ecb6f7d04a98/sv-benchmarks/c/ntdrivers-simplified/floppy_simpl4.cil-2.c [2021-10-15 19:34:56,255 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e01e5a5b-1932-41cb-a6fe-ecb6f7d04a98/bin/uautomizer-hJ6jxDFKc3/data/e571d9211/4267e1908eba437699ecb3e0504f5b15/FLAGa903c1b4c [2021-10-15 19:34:56,439 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e01e5a5b-1932-41cb-a6fe-ecb6f7d04a98/bin/uautomizer-hJ6jxDFKc3/data/e571d9211/4267e1908eba437699ecb3e0504f5b15 [2021-10-15 19:34:56,442 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-10-15 19:34:56,444 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2021-10-15 19:34:56,446 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-10-15 19:34:56,447 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-10-15 19:34:56,451 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-10-15 19:34:56,452 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 07:34:56" (1/1) ... [2021-10-15 19:34:56,453 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5cd82d9e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 07:34:56, skipping insertion in model container [2021-10-15 19:34:56,454 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 07:34:56" (1/1) ... [2021-10-15 19:34:56,462 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-10-15 19:34:56,568 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-10-15 19:34:57,041 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_e01e5a5b-1932-41cb-a6fe-ecb6f7d04a98/sv-benchmarks/c/ntdrivers-simplified/floppy_simpl4.cil-2.c[48585,48598] [2021-10-15 19:34:57,050 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-10-15 19:34:57,073 INFO L203 MainTranslator]: Completed pre-run [2021-10-15 19:34:57,217 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_e01e5a5b-1932-41cb-a6fe-ecb6f7d04a98/sv-benchmarks/c/ntdrivers-simplified/floppy_simpl4.cil-2.c[48585,48598] [2021-10-15 19:34:57,218 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-10-15 19:34:57,238 INFO L208 MainTranslator]: Completed translation [2021-10-15 19:34:57,239 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 07:34:57 WrapperNode [2021-10-15 19:34:57,239 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-10-15 19:34:57,240 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-10-15 19:34:57,241 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-10-15 19:34:57,241 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-10-15 19:34:57,255 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 07:34:57" (1/1) ... [2021-10-15 19:34:57,262 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 07:34:57" (1/1) ... [2021-10-15 19:34:57,300 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 07:34:57" (1/1) ... [2021-10-15 19:34:57,301 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 07:34:57" (1/1) ... [2021-10-15 19:34:57,365 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 07:34:57" (1/1) ... [2021-10-15 19:34:57,391 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 07:34:57" (1/1) ... [2021-10-15 19:34:57,421 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 07:34:57" (1/1) ... [2021-10-15 19:34:57,431 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-10-15 19:34:57,438 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-10-15 19:34:57,438 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-10-15 19:34:57,438 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-10-15 19:34:57,440 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 07:34:57" (1/1) ... [2021-10-15 19:34:57,449 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-10-15 19:34:57,462 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e01e5a5b-1932-41cb-a6fe-ecb6f7d04a98/bin/uautomizer-hJ6jxDFKc3/z3 [2021-10-15 19:34:57,481 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e01e5a5b-1932-41cb-a6fe-ecb6f7d04a98/bin/uautomizer-hJ6jxDFKc3/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-10-15 19:34:57,497 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e01e5a5b-1932-41cb-a6fe-ecb6f7d04a98/bin/uautomizer-hJ6jxDFKc3/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-10-15 19:34:57,534 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2021-10-15 19:34:57,535 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-10-15 19:34:57,535 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2021-10-15 19:34:57,535 INFO L138 BoogieDeclarations]: Found implementation of procedure _BLAST_init [2021-10-15 19:34:57,535 INFO L138 BoogieDeclarations]: Found implementation of procedure FlAcpiConfigureFloppy [2021-10-15 19:34:57,536 INFO L138 BoogieDeclarations]: Found implementation of procedure FlQueueIrpToThread [2021-10-15 19:34:57,537 INFO L138 BoogieDeclarations]: Found implementation of procedure FloppyPnp [2021-10-15 19:34:57,537 INFO L138 BoogieDeclarations]: Found implementation of procedure FloppyStartDevice [2021-10-15 19:34:57,537 INFO L138 BoogieDeclarations]: Found implementation of procedure FloppyPnpComplete [2021-10-15 19:34:57,540 INFO L138 BoogieDeclarations]: Found implementation of procedure FlFdcDeviceIo [2021-10-15 19:34:57,540 INFO L138 BoogieDeclarations]: Found implementation of procedure FloppyProcessQueuedRequests [2021-10-15 19:34:57,540 INFO L138 BoogieDeclarations]: Found implementation of procedure stub_driver_init [2021-10-15 19:34:57,540 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2021-10-15 19:34:57,541 INFO L138 BoogieDeclarations]: Found implementation of procedure IoBuildDeviceIoControlRequest [2021-10-15 19:34:57,541 INFO L138 BoogieDeclarations]: Found implementation of procedure IoDeleteSymbolicLink [2021-10-15 19:34:57,541 INFO L138 BoogieDeclarations]: Found implementation of procedure IoQueryDeviceDescription [2021-10-15 19:34:57,541 INFO L138 BoogieDeclarations]: Found implementation of procedure IoRegisterDeviceInterface [2021-10-15 19:34:57,541 INFO L138 BoogieDeclarations]: Found implementation of procedure IoSetDeviceInterfaceState [2021-10-15 19:34:57,541 INFO L138 BoogieDeclarations]: Found implementation of procedure stubMoreProcessingRequired [2021-10-15 19:34:57,542 INFO L138 BoogieDeclarations]: Found implementation of procedure IofCallDriver [2021-10-15 19:34:57,542 INFO L138 BoogieDeclarations]: Found implementation of procedure IofCompleteRequest [2021-10-15 19:34:57,542 INFO L138 BoogieDeclarations]: Found implementation of procedure KeSetEvent [2021-10-15 19:34:57,542 INFO L138 BoogieDeclarations]: Found implementation of procedure KeWaitForSingleObject [2021-10-15 19:34:57,542 INFO L138 BoogieDeclarations]: Found implementation of procedure ObReferenceObjectByHandle [2021-10-15 19:34:57,543 INFO L138 BoogieDeclarations]: Found implementation of procedure PsCreateSystemThread [2021-10-15 19:34:57,543 INFO L138 BoogieDeclarations]: Found implementation of procedure ZwClose [2021-10-15 19:34:57,543 INFO L138 BoogieDeclarations]: Found implementation of procedure FloppyCreateClose [2021-10-15 19:34:57,543 INFO L138 BoogieDeclarations]: Found implementation of procedure FloppyDeviceControl [2021-10-15 19:34:57,543 INFO L138 BoogieDeclarations]: Found implementation of procedure FlCheckFormatParameters [2021-10-15 19:34:57,544 INFO L138 BoogieDeclarations]: Found implementation of procedure FloppyQueueRequest [2021-10-15 19:34:57,544 INFO L138 BoogieDeclarations]: Found implementation of procedure errorFn [2021-10-15 19:34:57,544 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2021-10-15 19:34:57,544 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2021-10-15 19:34:57,544 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2021-10-15 19:34:57,545 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-10-15 19:34:57,545 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2021-10-15 19:34:57,545 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2021-10-15 19:34:57,545 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_long [2021-10-15 19:34:57,546 INFO L130 BoogieDeclarations]: Found specification of procedure FlAcpiConfigureFloppy [2021-10-15 19:34:57,546 INFO L130 BoogieDeclarations]: Found specification of procedure FlQueueIrpToThread [2021-10-15 19:34:57,546 INFO L130 BoogieDeclarations]: Found specification of procedure FloppyPnp [2021-10-15 19:34:57,546 INFO L130 BoogieDeclarations]: Found specification of procedure FloppyStartDevice [2021-10-15 19:34:57,546 INFO L130 BoogieDeclarations]: Found specification of procedure FloppyPnpComplete [2021-10-15 19:34:57,547 INFO L130 BoogieDeclarations]: Found specification of procedure FlFdcDeviceIo [2021-10-15 19:34:57,547 INFO L130 BoogieDeclarations]: Found specification of procedure IoBuildDeviceIoControlRequest [2021-10-15 19:34:57,547 INFO L130 BoogieDeclarations]: Found specification of procedure IoDeleteSymbolicLink [2021-10-15 19:34:57,547 INFO L130 BoogieDeclarations]: Found specification of procedure IoQueryDeviceDescription [2021-10-15 19:34:57,548 INFO L130 BoogieDeclarations]: Found specification of procedure IoRegisterDeviceInterface [2021-10-15 19:34:57,548 INFO L130 BoogieDeclarations]: Found specification of procedure IoSetDeviceInterfaceState [2021-10-15 19:34:57,548 INFO L130 BoogieDeclarations]: Found specification of procedure IofCallDriver [2021-10-15 19:34:57,548 INFO L130 BoogieDeclarations]: Found specification of procedure KeSetEvent [2021-10-15 19:34:57,548 INFO L130 BoogieDeclarations]: Found specification of procedure KeWaitForSingleObject [2021-10-15 19:34:57,549 INFO L130 BoogieDeclarations]: Found specification of procedure ObReferenceObjectByHandle [2021-10-15 19:34:57,549 INFO L130 BoogieDeclarations]: Found specification of procedure PsCreateSystemThread [2021-10-15 19:34:57,549 INFO L130 BoogieDeclarations]: Found specification of procedure ZwClose [2021-10-15 19:34:57,549 INFO L130 BoogieDeclarations]: Found specification of procedure FloppyCreateClose [2021-10-15 19:34:57,550 INFO L130 BoogieDeclarations]: Found specification of procedure FloppyQueueRequest [2021-10-15 19:34:57,550 INFO L130 BoogieDeclarations]: Found specification of procedure FloppyDeviceControl [2021-10-15 19:34:57,550 INFO L130 BoogieDeclarations]: Found specification of procedure FlCheckFormatParameters [2021-10-15 19:34:57,550 INFO L130 BoogieDeclarations]: Found specification of procedure errorFn [2021-10-15 19:34:57,550 INFO L130 BoogieDeclarations]: Found specification of procedure IofCompleteRequest [2021-10-15 19:34:57,551 INFO L130 BoogieDeclarations]: Found specification of procedure _BLAST_init [2021-10-15 19:34:57,551 INFO L130 BoogieDeclarations]: Found specification of procedure FloppyProcessQueuedRequests [2021-10-15 19:34:57,551 INFO L130 BoogieDeclarations]: Found specification of procedure stub_driver_init [2021-10-15 19:34:57,551 INFO L130 BoogieDeclarations]: Found specification of procedure main [2021-10-15 19:34:57,552 INFO L130 BoogieDeclarations]: Found specification of procedure stubMoreProcessingRequired [2021-10-15 19:34:57,553 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2021-10-15 19:34:57,553 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-10-15 19:34:57,554 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-10-15 19:34:57,554 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-10-15 19:34:57,554 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-10-15 19:34:57,554 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-10-15 19:34:57,905 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-10-15 19:34:57,948 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !false; [2021-10-15 19:34:57,948 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume false; [2021-10-15 19:34:57,957 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-10-15 19:34:57,968 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !false; [2021-10-15 19:34:57,968 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume false; [2021-10-15 19:34:57,973 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-10-15 19:34:58,260 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##21: assume !false; [2021-10-15 19:34:58,261 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##20: assume false; [2021-10-15 19:34:58,264 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-10-15 19:34:58,370 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##17: assume !false; [2021-10-15 19:34:58,370 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##16: assume false; [2021-10-15 19:34:58,385 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-10-15 19:34:58,401 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##16: assume !false; [2021-10-15 19:34:58,401 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##15: assume false; [2021-10-15 19:34:58,513 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-10-15 19:34:58,522 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !false; [2021-10-15 19:34:58,522 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume false; [2021-10-15 19:34:58,523 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-10-15 19:34:58,546 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !false; [2021-10-15 19:34:58,546 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume false; [2021-10-15 19:34:58,547 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-10-15 19:34:58,558 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !false; [2021-10-15 19:34:58,558 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume false; [2021-10-15 19:34:58,640 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-10-15 19:34:58,705 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##12: assume !false; [2021-10-15 19:34:58,705 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##11: assume false; [2021-10-15 19:34:58,711 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-10-15 19:34:58,906 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##38: assume !false; [2021-10-15 19:34:58,906 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##37: assume false; [2021-10-15 19:34:58,994 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-10-15 19:34:59,001 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !false; [2021-10-15 19:34:59,001 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume false; [2021-10-15 19:34:59,002 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-10-15 19:34:59,021 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !false; [2021-10-15 19:34:59,021 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume false; [2021-10-15 19:34:59,021 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-10-15 19:34:59,027 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !false; [2021-10-15 19:34:59,028 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume false; [2021-10-15 19:34:59,079 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-10-15 19:34:59,079 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2021-10-15 19:34:59,083 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 07:34:59 BoogieIcfgContainer [2021-10-15 19:34:59,083 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-10-15 19:34:59,086 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-10-15 19:34:59,086 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-10-15 19:34:59,094 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-10-15 19:34:59,094 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.10 07:34:56" (1/3) ... [2021-10-15 19:34:59,095 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7bec593 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 07:34:59, skipping insertion in model container [2021-10-15 19:34:59,096 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 07:34:57" (2/3) ... [2021-10-15 19:34:59,096 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7bec593 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 07:34:59, skipping insertion in model container [2021-10-15 19:34:59,097 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 07:34:59" (3/3) ... [2021-10-15 19:34:59,099 INFO L111 eAbstractionObserver]: Analyzing ICFG floppy_simpl4.cil-2.c [2021-10-15 19:34:59,106 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-10-15 19:34:59,107 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2021-10-15 19:34:59,170 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-10-15 19:34:59,178 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-15 19:34:59,178 INFO L340 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2021-10-15 19:34:59,212 INFO L276 IsEmpty]: Start isEmpty. Operand has 390 states, 288 states have (on average 1.4722222222222223) internal successors, (424), 315 states have internal predecessors, (424), 71 states have call successors, (71), 28 states have call predecessors, (71), 28 states have return successors, (71), 66 states have call predecessors, (71), 71 states have call successors, (71) [2021-10-15 19:34:59,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2021-10-15 19:34:59,222 INFO L504 BasicCegarLoop]: Found error trace [2021-10-15 19:34:59,223 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-15 19:34:59,224 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting mainErr0ENSURES_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2021-10-15 19:34:59,230 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-15 19:34:59,230 INFO L82 PathProgramCache]: Analyzing trace with hash 495257184, now seen corresponding path program 1 times [2021-10-15 19:34:59,241 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-15 19:34:59,242 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [455871214] [2021-10-15 19:34:59,242 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-15 19:34:59,243 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-15 19:34:59,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-15 19:34:59,640 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-10-15 19:34:59,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-15 19:34:59,714 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-10-15 19:34:59,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-15 19:34:59,729 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-15 19:34:59,729 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-15 19:34:59,730 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [455871214] [2021-10-15 19:34:59,731 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [455871214] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-15 19:34:59,731 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-15 19:34:59,731 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-15 19:34:59,734 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1161397882] [2021-10-15 19:34:59,740 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-15 19:34:59,740 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-15 19:34:59,810 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-15 19:34:59,812 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-10-15 19:34:59,819 INFO L87 Difference]: Start difference. First operand has 390 states, 288 states have (on average 1.4722222222222223) internal successors, (424), 315 states have internal predecessors, (424), 71 states have call successors, (71), 28 states have call predecessors, (71), 28 states have return successors, (71), 66 states have call predecessors, (71), 71 states have call successors, (71) 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-15 19:35:01,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-15 19:35:01,143 INFO L93 Difference]: Finished difference Result 429 states and 603 transitions. [2021-10-15 19:35:01,144 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-15 19:35:01,146 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-15 19:35:01,147 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-15 19:35:01,163 INFO L225 Difference]: With dead ends: 429 [2021-10-15 19:35:01,164 INFO L226 Difference]: Without dead ends: 422 [2021-10-15 19:35:01,165 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 145.4ms TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-10-15 19:35:01,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 422 states. [2021-10-15 19:35:01,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 422 to 380. [2021-10-15 19:35:01,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 380 states, 282 states have (on average 1.4326241134751774) internal successors, (404), 306 states have internal predecessors, (404), 71 states have call successors, (71), 28 states have call predecessors, (71), 26 states have return successors, (49), 48 states have call predecessors, (49), 49 states have call successors, (49) [2021-10-15 19:35:01,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 380 states to 380 states and 524 transitions. [2021-10-15 19:35:01,247 INFO L78 Accepts]: Start accepts. Automaton has 380 states and 524 transitions. Word has length 15 [2021-10-15 19:35:01,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-15 19:35:01,248 INFO L470 AbstractCegarLoop]: Abstraction has 380 states and 524 transitions. [2021-10-15 19:35:01,248 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-15 19:35:01,248 INFO L276 IsEmpty]: Start isEmpty. Operand 380 states and 524 transitions. [2021-10-15 19:35:01,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-10-15 19:35:01,249 INFO L504 BasicCegarLoop]: Found error trace [2021-10-15 19:35:01,249 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-15 19:35:01,250 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-10-15 19:35:01,250 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2021-10-15 19:35:01,251 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-15 19:35:01,251 INFO L82 PathProgramCache]: Analyzing trace with hash 1971419500, now seen corresponding path program 1 times [2021-10-15 19:35:01,251 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-15 19:35:01,251 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [814209604] [2021-10-15 19:35:01,252 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-15 19:35:01,252 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-15 19:35:01,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-15 19:35:01,477 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-10-15 19:35:01,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-15 19:35:01,528 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-10-15 19:35:01,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-15 19:35:01,542 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-15 19:35:01,543 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-15 19:35:01,543 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [814209604] [2021-10-15 19:35:01,544 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [814209604] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-15 19:35:01,544 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-15 19:35:01,544 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-10-15 19:35:01,544 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2129090503] [2021-10-15 19:35:01,546 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-10-15 19:35:01,546 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-15 19:35:01,547 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-10-15 19:35:01,548 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-10-15 19:35:01,548 INFO L87 Difference]: Start difference. First operand 380 states and 524 transitions. Second operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 3 states have internal predecessors, (14), 3 states have call successors, (4), 4 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-10-15 19:35:03,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-15 19:35:03,181 INFO L93 Difference]: Finished difference Result 422 states and 586 transitions. [2021-10-15 19:35:03,181 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-10-15 19:35:03,182 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), 3 states have call successors, (4), 4 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 20 [2021-10-15 19:35:03,182 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-15 19:35:03,188 INFO L225 Difference]: With dead ends: 422 [2021-10-15 19:35:03,188 INFO L226 Difference]: Without dead ends: 422 [2021-10-15 19:35:03,189 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 152.7ms TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-10-15 19:35:03,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 422 states. [2021-10-15 19:35:03,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 422 to 380. [2021-10-15 19:35:03,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 380 states, 282 states have (on average 1.429078014184397) internal successors, (403), 306 states have internal predecessors, (403), 71 states have call successors, (71), 28 states have call predecessors, (71), 26 states have return successors, (49), 48 states have call predecessors, (49), 49 states have call successors, (49) [2021-10-15 19:35:03,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 380 states to 380 states and 523 transitions. [2021-10-15 19:35:03,230 INFO L78 Accepts]: Start accepts. Automaton has 380 states and 523 transitions. Word has length 20 [2021-10-15 19:35:03,230 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-15 19:35:03,231 INFO L470 AbstractCegarLoop]: Abstraction has 380 states and 523 transitions. [2021-10-15 19:35:03,231 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), 3 states have call successors, (4), 4 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-10-15 19:35:03,231 INFO L276 IsEmpty]: Start isEmpty. Operand 380 states and 523 transitions. [2021-10-15 19:35:03,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2021-10-15 19:35:03,233 INFO L504 BasicCegarLoop]: Found error trace [2021-10-15 19:35:03,233 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-15 19:35:03,233 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-10-15 19:35:03,234 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2021-10-15 19:35:03,234 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-15 19:35:03,235 INFO L82 PathProgramCache]: Analyzing trace with hash 809317868, now seen corresponding path program 1 times [2021-10-15 19:35:03,235 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-15 19:35:03,236 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1213436908] [2021-10-15 19:35:03,236 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-15 19:35:03,236 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-15 19:35:03,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-15 19:35:03,449 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-10-15 19:35:03,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-15 19:35:03,503 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-10-15 19:35:03,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-15 19:35:03,538 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-10-15 19:35:03,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-15 19:35:03,553 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-15 19:35:03,554 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-15 19:35:03,554 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1213436908] [2021-10-15 19:35:03,555 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1213436908] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-15 19:35:03,556 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-15 19:35:03,556 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-10-15 19:35:03,557 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1023825630] [2021-10-15 19:35:03,558 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-10-15 19:35:03,559 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-15 19:35:03,560 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-10-15 19:35:03,560 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2021-10-15 19:35:03,561 INFO L87 Difference]: Start difference. First operand 380 states and 523 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-15 19:35:05,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-15 19:35:05,435 INFO L93 Difference]: Finished difference Result 585 states and 798 transitions. [2021-10-15 19:35:05,436 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-10-15 19:35:05,436 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-15 19:35:05,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-15 19:35:05,451 INFO L225 Difference]: With dead ends: 585 [2021-10-15 19:35:05,452 INFO L226 Difference]: Without dead ends: 584 [2021-10-15 19:35:05,456 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 302.1ms TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2021-10-15 19:35:05,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 584 states. [2021-10-15 19:35:05,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 584 to 525. [2021-10-15 19:35:05,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 525 states, 405 states have (on average 1.3530864197530865) internal successors, (548), 410 states have internal predecessors, (548), 78 states have call successors, (78), 41 states have call predecessors, (78), 41 states have return successors, (90), 75 states have call predecessors, (90), 66 states have call successors, (90) [2021-10-15 19:35:05,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 525 states to 525 states and 716 transitions. [2021-10-15 19:35:05,536 INFO L78 Accepts]: Start accepts. Automaton has 525 states and 716 transitions. Word has length 25 [2021-10-15 19:35:05,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-15 19:35:05,536 INFO L470 AbstractCegarLoop]: Abstraction has 525 states and 716 transitions. [2021-10-15 19:35:05,537 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-15 19:35:05,537 INFO L276 IsEmpty]: Start isEmpty. Operand 525 states and 716 transitions. [2021-10-15 19:35:05,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2021-10-15 19:35:05,539 INFO L504 BasicCegarLoop]: Found error trace [2021-10-15 19:35:05,539 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-15 19:35:05,539 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-10-15 19:35:05,539 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2021-10-15 19:35:05,540 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-15 19:35:05,540 INFO L82 PathProgramCache]: Analyzing trace with hash 1577074200, now seen corresponding path program 1 times [2021-10-15 19:35:05,540 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-15 19:35:05,540 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2095247699] [2021-10-15 19:35:05,541 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-15 19:35:05,541 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-15 19:35:05,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-15 19:35:05,805 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-10-15 19:35:05,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-15 19:35:05,844 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-10-15 19:35:05,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-15 19:35:05,899 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-10-15 19:35:05,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-15 19:35:05,905 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-15 19:35:05,906 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-15 19:35:05,906 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2095247699] [2021-10-15 19:35:05,906 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2095247699] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-15 19:35:05,906 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-15 19:35:05,906 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-10-15 19:35:05,907 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1899392283] [2021-10-15 19:35:05,907 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-10-15 19:35:05,907 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-15 19:35:05,908 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-10-15 19:35:05,908 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2021-10-15 19:35:05,909 INFO L87 Difference]: Start difference. First operand 525 states and 716 transitions. Second operand has 6 states, 6 states have (on average 3.5) internal successors, (21), 3 states have internal predecessors, (21), 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-15 19:35:07,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-15 19:35:07,110 INFO L93 Difference]: Finished difference Result 676 states and 906 transitions. [2021-10-15 19:35:07,110 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-10-15 19:35:07,111 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.5) internal successors, (21), 3 states have internal predecessors, (21), 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 31 [2021-10-15 19:35:07,111 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-15 19:35:07,117 INFO L225 Difference]: With dead ends: 676 [2021-10-15 19:35:07,118 INFO L226 Difference]: Without dead ends: 676 [2021-10-15 19:35:07,118 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 303.4ms TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2021-10-15 19:35:07,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 676 states. [2021-10-15 19:35:07,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 676 to 583. [2021-10-15 19:35:07,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 583 states, 450 states have (on average 1.3488888888888888) internal successors, (607), 463 states have internal predecessors, (607), 82 states have call successors, (82), 46 states have call predecessors, (82), 50 states have return successors, (101), 78 states have call predecessors, (101), 72 states have call successors, (101) [2021-10-15 19:35:07,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 583 states to 583 states and 790 transitions. [2021-10-15 19:35:07,155 INFO L78 Accepts]: Start accepts. Automaton has 583 states and 790 transitions. Word has length 31 [2021-10-15 19:35:07,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-15 19:35:07,156 INFO L470 AbstractCegarLoop]: Abstraction has 583 states and 790 transitions. [2021-10-15 19:35:07,156 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.5) internal successors, (21), 3 states have internal predecessors, (21), 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-15 19:35:07,157 INFO L276 IsEmpty]: Start isEmpty. Operand 583 states and 790 transitions. [2021-10-15 19:35:07,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2021-10-15 19:35:07,159 INFO L504 BasicCegarLoop]: Found error trace [2021-10-15 19:35:07,160 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] [2021-10-15 19:35:07,160 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-10-15 19:35:07,160 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2021-10-15 19:35:07,161 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-15 19:35:07,161 INFO L82 PathProgramCache]: Analyzing trace with hash 1576156776, now seen corresponding path program 1 times [2021-10-15 19:35:07,161 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-15 19:35:07,162 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [651642554] [2021-10-15 19:35:07,162 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-15 19:35:07,162 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-15 19:35:07,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-15 19:35:07,348 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-10-15 19:35:07,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-15 19:35:07,384 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-10-15 19:35:07,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-15 19:35:07,403 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-10-15 19:35:07,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-15 19:35:07,411 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-15 19:35:07,411 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-15 19:35:07,412 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [651642554] [2021-10-15 19:35:07,412 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [651642554] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-15 19:35:07,412 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-15 19:35:07,413 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-10-15 19:35:07,413 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1350482262] [2021-10-15 19:35:07,413 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-10-15 19:35:07,414 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-15 19:35:07,414 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-10-15 19:35:07,415 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2021-10-15 19:35:07,415 INFO L87 Difference]: Start difference. First operand 583 states and 790 transitions. Second operand has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 3 states have internal predecessors, (23), 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-15 19:35:09,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-15 19:35:09,423 INFO L93 Difference]: Finished difference Result 819 states and 1102 transitions. [2021-10-15 19:35:09,424 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-10-15 19:35:09,424 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 3 states have internal predecessors, (23), 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 33 [2021-10-15 19:35:09,425 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-15 19:35:09,432 INFO L225 Difference]: With dead ends: 819 [2021-10-15 19:35:09,432 INFO L226 Difference]: Without dead ends: 819 [2021-10-15 19:35:09,433 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 239.8ms TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2021-10-15 19:35:09,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 819 states. [2021-10-15 19:35:09,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 819 to 771. [2021-10-15 19:35:09,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 771 states, 606 states have (on average 1.33993399339934) internal successors, (812), 616 states have internal predecessors, (812), 99 states have call successors, (99), 61 states have call predecessors, (99), 65 states have return successors, (136), 97 states have call predecessors, (136), 91 states have call successors, (136) [2021-10-15 19:35:09,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 771 states to 771 states and 1047 transitions. [2021-10-15 19:35:09,493 INFO L78 Accepts]: Start accepts. Automaton has 771 states and 1047 transitions. Word has length 33 [2021-10-15 19:35:09,493 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-15 19:35:09,494 INFO L470 AbstractCegarLoop]: Abstraction has 771 states and 1047 transitions. [2021-10-15 19:35:09,494 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 3 states have internal predecessors, (23), 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-15 19:35:09,494 INFO L276 IsEmpty]: Start isEmpty. Operand 771 states and 1047 transitions. [2021-10-15 19:35:09,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-15 19:35:09,504 INFO L504 BasicCegarLoop]: Found error trace [2021-10-15 19:35:09,504 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] [2021-10-15 19:35:09,504 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-10-15 19:35:09,505 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2021-10-15 19:35:09,505 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-15 19:35:09,505 INFO L82 PathProgramCache]: Analyzing trace with hash 1228281964, now seen corresponding path program 1 times [2021-10-15 19:35:09,506 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-15 19:35:09,506 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1413018862] [2021-10-15 19:35:09,506 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-15 19:35:09,506 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-15 19:35:09,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-15 19:35:09,640 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-10-15 19:35:09,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-15 19:35:09,680 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-10-15 19:35:09,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-15 19:35:09,704 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-10-15 19:35:09,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-15 19:35:09,724 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-10-15 19:35:09,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-15 19:35:09,739 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-10-15 19:35:09,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-15 19:35:09,744 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-15 19:35:09,745 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-15 19:35:09,745 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1413018862] [2021-10-15 19:35:09,745 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1413018862] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-15 19:35:09,745 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-15 19:35:09,746 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-10-15 19:35:09,746 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [254221745] [2021-10-15 19:35:09,746 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-10-15 19:35:09,746 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-15 19:35:09,747 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-10-15 19:35:09,747 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2021-10-15 19:35:09,748 INFO L87 Difference]: Start difference. First operand 771 states and 1047 transitions. Second operand has 8 states, 8 states have (on average 3.25) internal successors, (26), 3 states have internal predecessors, (26), 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-15 19:35:11,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-15 19:35:11,060 INFO L93 Difference]: Finished difference Result 860 states and 1157 transitions. [2021-10-15 19:35:11,063 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-10-15 19:35:11,063 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.25) internal successors, (26), 3 states have internal predecessors, (26), 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 38 [2021-10-15 19:35:11,064 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-15 19:35:11,070 INFO L225 Difference]: With dead ends: 860 [2021-10-15 19:35:11,070 INFO L226 Difference]: Without dead ends: 860 [2021-10-15 19:35:11,070 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 261.9ms TimeCoverageRelationStatistics Valid=37, Invalid=53, Unknown=0, NotChecked=0, Total=90 [2021-10-15 19:35:11,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 860 states. [2021-10-15 19:35:11,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 860 to 808. [2021-10-15 19:35:11,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 808 states, 636 states have (on average 1.3333333333333333) internal successors, (848), 648 states have internal predecessors, (848), 99 states have call successors, (99), 61 states have call predecessors, (99), 72 states have return successors, (143), 100 states have call predecessors, (143), 91 states have call successors, (143) [2021-10-15 19:35:11,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 808 states to 808 states and 1090 transitions. [2021-10-15 19:35:11,110 INFO L78 Accepts]: Start accepts. Automaton has 808 states and 1090 transitions. Word has length 38 [2021-10-15 19:35:11,110 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-15 19:35:11,110 INFO L470 AbstractCegarLoop]: Abstraction has 808 states and 1090 transitions. [2021-10-15 19:35:11,111 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.25) internal successors, (26), 3 states have internal predecessors, (26), 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-15 19:35:11,111 INFO L276 IsEmpty]: Start isEmpty. Operand 808 states and 1090 transitions. [2021-10-15 19:35:11,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-15 19:35:11,113 INFO L504 BasicCegarLoop]: Found error trace [2021-10-15 19:35:11,113 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] [2021-10-15 19:35:11,113 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-10-15 19:35:11,114 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2021-10-15 19:35:11,114 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-15 19:35:11,115 INFO L82 PathProgramCache]: Analyzing trace with hash 452689020, now seen corresponding path program 1 times [2021-10-15 19:35:11,115 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-15 19:35:11,115 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1125111731] [2021-10-15 19:35:11,116 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-15 19:35:11,116 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-15 19:35:11,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-15 19:35:11,307 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-10-15 19:35:11,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-15 19:35:11,354 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-10-15 19:35:11,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-15 19:35:11,381 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-10-15 19:35:11,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-15 19:35:11,387 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-15 19:35:11,387 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-15 19:35:11,388 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1125111731] [2021-10-15 19:35:11,389 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1125111731] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-15 19:35:11,389 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-15 19:35:11,390 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-10-15 19:35:11,390 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [471151764] [2021-10-15 19:35:11,390 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-10-15 19:35:11,390 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-15 19:35:11,391 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-10-15 19:35:11,391 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2021-10-15 19:35:11,392 INFO L87 Difference]: Start difference. First operand 808 states and 1090 transitions. Second operand has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 3 states have internal predecessors, (28), 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-15 19:35:12,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-15 19:35:12,577 INFO L93 Difference]: Finished difference Result 839 states and 1128 transitions. [2021-10-15 19:35:12,579 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-10-15 19:35:12,579 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 3 states have internal predecessors, (28), 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 38 [2021-10-15 19:35:12,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-15 19:35:12,585 INFO L225 Difference]: With dead ends: 839 [2021-10-15 19:35:12,585 INFO L226 Difference]: Without dead ends: 839 [2021-10-15 19:35:12,586 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 267.3ms TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2021-10-15 19:35:12,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 839 states. [2021-10-15 19:35:12,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 839 to 819. [2021-10-15 19:35:12,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 819 states, 647 states have (on average 1.3323029366306027) internal successors, (862), 658 states have internal predecessors, (862), 99 states have call successors, (99), 62 states have call predecessors, (99), 72 states have return successors, (143), 100 states have call predecessors, (143), 91 states have call successors, (143) [2021-10-15 19:35:12,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 819 states to 819 states and 1104 transitions. [2021-10-15 19:35:12,622 INFO L78 Accepts]: Start accepts. Automaton has 819 states and 1104 transitions. Word has length 38 [2021-10-15 19:35:12,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-15 19:35:12,623 INFO L470 AbstractCegarLoop]: Abstraction has 819 states and 1104 transitions. [2021-10-15 19:35:12,623 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 3 states have internal predecessors, (28), 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-15 19:35:12,623 INFO L276 IsEmpty]: Start isEmpty. Operand 819 states and 1104 transitions. [2021-10-15 19:35:12,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2021-10-15 19:35:12,625 INFO L504 BasicCegarLoop]: Found error trace [2021-10-15 19:35:12,625 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-15 19:35:12,625 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-10-15 19:35:12,625 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2021-10-15 19:35:12,626 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-15 19:35:12,626 INFO L82 PathProgramCache]: Analyzing trace with hash -126316899, now seen corresponding path program 1 times [2021-10-15 19:35:12,626 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-15 19:35:12,626 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1125203717] [2021-10-15 19:35:12,626 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-15 19:35:12,627 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-15 19:35:12,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-15 19:35:12,823 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-10-15 19:35:12,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-15 19:35:12,869 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-10-15 19:35:12,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-15 19:35:12,917 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-10-15 19:35:12,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-15 19:35:12,937 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-10-15 19:35:12,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-15 19:35:12,993 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-10-15 19:35:12,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-15 19:35:13,020 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-15 19:35:13,020 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-15 19:35:13,021 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1125203717] [2021-10-15 19:35:13,021 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1125203717] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-15 19:35:13,021 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-15 19:35:13,022 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-10-15 19:35:13,022 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1209706009] [2021-10-15 19:35:13,023 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-10-15 19:35:13,023 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-15 19:35:13,024 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-10-15 19:35:13,024 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2021-10-15 19:35:13,025 INFO L87 Difference]: Start difference. First operand 819 states and 1104 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-15 19:35:15,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-15 19:35:15,402 INFO L93 Difference]: Finished difference Result 871 states and 1170 transitions. [2021-10-15 19:35:15,402 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-10-15 19:35:15,403 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-15 19:35:15,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-15 19:35:15,409 INFO L225 Difference]: With dead ends: 871 [2021-10-15 19:35:15,410 INFO L226 Difference]: Without dead ends: 871 [2021-10-15 19:35:15,410 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 809.4ms TimeCoverageRelationStatistics Valid=111, Invalid=269, Unknown=0, NotChecked=0, Total=380 [2021-10-15 19:35:15,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 871 states. [2021-10-15 19:35:15,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 871 to 819. [2021-10-15 19:35:15,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 819 states, 647 states have (on average 1.330757341576507) internal successors, (861), 658 states have internal predecessors, (861), 99 states have call successors, (99), 62 states have call predecessors, (99), 72 states have return successors, (143), 100 states have call predecessors, (143), 91 states have call successors, (143) [2021-10-15 19:35:15,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 819 states to 819 states and 1103 transitions. [2021-10-15 19:35:15,446 INFO L78 Accepts]: Start accepts. Automaton has 819 states and 1103 transitions. Word has length 39 [2021-10-15 19:35:15,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-15 19:35:15,446 INFO L470 AbstractCegarLoop]: Abstraction has 819 states and 1103 transitions. [2021-10-15 19:35:15,447 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-15 19:35:15,447 INFO L276 IsEmpty]: Start isEmpty. Operand 819 states and 1103 transitions. [2021-10-15 19:35:15,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2021-10-15 19:35:15,448 INFO L504 BasicCegarLoop]: Found error trace [2021-10-15 19:35:15,449 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-15 19:35:15,449 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-10-15 19:35:15,449 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2021-10-15 19:35:15,450 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-15 19:35:15,450 INFO L82 PathProgramCache]: Analyzing trace with hash -481477895, now seen corresponding path program 1 times [2021-10-15 19:35:15,450 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-15 19:35:15,451 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [777559688] [2021-10-15 19:35:15,451 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-15 19:35:15,451 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-15 19:35:15,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-15 19:35:15,596 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-10-15 19:35:15,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-15 19:35:15,656 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-10-15 19:35:15,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-15 19:35:15,688 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-10-15 19:35:15,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-15 19:35:15,705 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-10-15 19:35:15,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-15 19:35:15,762 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-10-15 19:35:15,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-15 19:35:15,791 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-15 19:35:15,791 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-15 19:35:15,791 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [777559688] [2021-10-15 19:35:15,792 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [777559688] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-15 19:35:15,792 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-15 19:35:15,792 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-10-15 19:35:15,792 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [427224790] [2021-10-15 19:35:15,795 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-10-15 19:35:15,795 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-15 19:35:15,796 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-10-15 19:35:15,796 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2021-10-15 19:35:15,796 INFO L87 Difference]: Start difference. First operand 819 states and 1103 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-15 19:35:18,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-15 19:35:18,094 INFO L93 Difference]: Finished difference Result 871 states and 1169 transitions. [2021-10-15 19:35:18,094 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-10-15 19:35:18,094 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-15 19:35:18,098 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-15 19:35:18,104 INFO L225 Difference]: With dead ends: 871 [2021-10-15 19:35:18,104 INFO L226 Difference]: Without dead ends: 871 [2021-10-15 19:35:18,106 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 634.0ms TimeCoverageRelationStatistics Valid=111, Invalid=269, Unknown=0, NotChecked=0, Total=380 [2021-10-15 19:35:18,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 871 states. [2021-10-15 19:35:18,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 871 to 819. [2021-10-15 19:35:18,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 819 states, 647 states have (on average 1.3292117465224111) internal successors, (860), 658 states have internal predecessors, (860), 99 states have call successors, (99), 62 states have call predecessors, (99), 72 states have return successors, (143), 100 states have call predecessors, (143), 91 states have call successors, (143) [2021-10-15 19:35:18,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 819 states to 819 states and 1102 transitions. [2021-10-15 19:35:18,170 INFO L78 Accepts]: Start accepts. Automaton has 819 states and 1102 transitions. Word has length 40 [2021-10-15 19:35:18,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-15 19:35:18,173 INFO L470 AbstractCegarLoop]: Abstraction has 819 states and 1102 transitions. [2021-10-15 19:35:18,174 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-15 19:35:18,174 INFO L276 IsEmpty]: Start isEmpty. Operand 819 states and 1102 transitions. [2021-10-15 19:35:18,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2021-10-15 19:35:18,176 INFO L504 BasicCegarLoop]: Found error trace [2021-10-15 19:35:18,176 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-15 19:35:18,177 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-10-15 19:35:18,177 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2021-10-15 19:35:18,178 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-15 19:35:18,178 INFO L82 PathProgramCache]: Analyzing trace with hash -1957366842, now seen corresponding path program 1 times [2021-10-15 19:35:18,178 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-15 19:35:18,180 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [200877086] [2021-10-15 19:35:18,180 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-15 19:35:18,181 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-15 19:35:18,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-15 19:35:18,330 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-10-15 19:35:18,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-15 19:35:18,363 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-10-15 19:35:18,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-15 19:35:18,382 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-10-15 19:35:18,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-15 19:35:18,397 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-10-15 19:35:18,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-15 19:35:18,448 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-10-15 19:35:18,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-15 19:35:18,452 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-15 19:35:18,452 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-15 19:35:18,452 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [200877086] [2021-10-15 19:35:18,452 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [200877086] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-15 19:35:18,453 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-15 19:35:18,453 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-10-15 19:35:18,453 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1194157535] [2021-10-15 19:35:18,454 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-10-15 19:35:18,454 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-15 19:35:18,455 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-10-15 19:35:18,455 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2021-10-15 19:35:18,455 INFO L87 Difference]: Start difference. First operand 819 states and 1102 transitions. Second operand has 10 states, 10 states have (on average 2.9) internal successors, (29), 4 states have internal predecessors, (29), 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-15 19:35:20,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-15 19:35:20,256 INFO L93 Difference]: Finished difference Result 879 states and 1177 transitions. [2021-10-15 19:35:20,256 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-10-15 19:35:20,256 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.9) internal successors, (29), 4 states have internal predecessors, (29), 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 41 [2021-10-15 19:35:20,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-15 19:35:20,262 INFO L225 Difference]: With dead ends: 879 [2021-10-15 19:35:20,262 INFO L226 Difference]: Without dead ends: 867 [2021-10-15 19:35:20,263 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 178.5ms TimeCoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2021-10-15 19:35:20,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 867 states. [2021-10-15 19:35:20,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 867 to 817. [2021-10-15 19:35:20,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 817 states, 646 states have (on average 1.328173374613003) internal successors, (858), 657 states have internal predecessors, (858), 98 states have call successors, (98), 62 states have call predecessors, (98), 72 states have return successors, (142), 99 states have call predecessors, (142), 90 states have call successors, (142) [2021-10-15 19:35:20,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 817 states to 817 states and 1098 transitions. [2021-10-15 19:35:20,295 INFO L78 Accepts]: Start accepts. Automaton has 817 states and 1098 transitions. Word has length 41 [2021-10-15 19:35:20,296 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-15 19:35:20,296 INFO L470 AbstractCegarLoop]: Abstraction has 817 states and 1098 transitions. [2021-10-15 19:35:20,296 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.9) internal successors, (29), 4 states have internal predecessors, (29), 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-15 19:35:20,296 INFO L276 IsEmpty]: Start isEmpty. Operand 817 states and 1098 transitions. [2021-10-15 19:35:20,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2021-10-15 19:35:20,298 INFO L504 BasicCegarLoop]: Found error trace [2021-10-15 19:35:20,298 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-15 19:35:20,299 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-10-15 19:35:20,299 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2021-10-15 19:35:20,299 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-15 19:35:20,300 INFO L82 PathProgramCache]: Analyzing trace with hash -884481493, now seen corresponding path program 1 times [2021-10-15 19:35:20,300 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-15 19:35:20,302 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2058113707] [2021-10-15 19:35:20,303 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-15 19:35:20,303 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-15 19:35:20,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-15 19:35:20,465 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-10-15 19:35:20,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-15 19:35:20,504 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-10-15 19:35:20,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-15 19:35:20,524 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-10-15 19:35:20,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-15 19:35:20,536 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2021-10-15 19:35:20,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-15 19:35:20,564 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-10-15 19:35:20,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-15 19:35:20,567 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-15 19:35:20,568 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-15 19:35:20,568 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2058113707] [2021-10-15 19:35:20,568 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2058113707] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-15 19:35:20,568 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-15 19:35:20,569 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-10-15 19:35:20,569 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [699457922] [2021-10-15 19:35:20,569 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-10-15 19:35:20,569 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-15 19:35:20,570 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-10-15 19:35:20,570 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2021-10-15 19:35:20,571 INFO L87 Difference]: Start difference. First operand 817 states and 1098 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-15 19:35:22,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-15 19:35:22,552 INFO L93 Difference]: Finished difference Result 877 states and 1173 transitions. [2021-10-15 19:35:22,552 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-10-15 19:35:22,552 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-15 19:35:22,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-15 19:35:22,559 INFO L225 Difference]: With dead ends: 877 [2021-10-15 19:35:22,559 INFO L226 Difference]: Without dead ends: 860 [2021-10-15 19:35:22,560 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 195.7ms TimeCoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2021-10-15 19:35:22,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 860 states. [2021-10-15 19:35:22,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 860 to 810. [2021-10-15 19:35:22,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 810 states, 642 states have (on average 1.3286604361370717) internal successors, (853), 653 states have internal predecessors, (853), 96 states have call successors, (96), 61 states have call predecessors, (96), 71 states have return successors, (140), 97 states have call predecessors, (140), 88 states have call successors, (140) [2021-10-15 19:35:22,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 810 states to 810 states and 1089 transitions. [2021-10-15 19:35:22,590 INFO L78 Accepts]: Start accepts. Automaton has 810 states and 1089 transitions. Word has length 42 [2021-10-15 19:35:22,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-15 19:35:22,591 INFO L470 AbstractCegarLoop]: Abstraction has 810 states and 1089 transitions. [2021-10-15 19:35:22,591 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-15 19:35:22,591 INFO L276 IsEmpty]: Start isEmpty. Operand 810 states and 1089 transitions. [2021-10-15 19:35:22,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2021-10-15 19:35:22,593 INFO L504 BasicCegarLoop]: Found error trace [2021-10-15 19:35:22,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-15 19:35:22,594 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-10-15 19:35:22,594 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2021-10-15 19:35:22,594 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-15 19:35:22,595 INFO L82 PathProgramCache]: Analyzing trace with hash -586304541, now seen corresponding path program 1 times [2021-10-15 19:35:22,595 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-15 19:35:22,595 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2123323508] [2021-10-15 19:35:22,595 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-15 19:35:22,595 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-15 19:35:22,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-15 19:35:22,718 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-10-15 19:35:22,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-15 19:35:22,751 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-10-15 19:35:22,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-15 19:35:22,768 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-10-15 19:35:22,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-15 19:35:22,784 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-10-15 19:35:22,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-15 19:35:22,820 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-15 19:35:22,821 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-15 19:35:22,821 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2123323508] [2021-10-15 19:35:22,823 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2123323508] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-15 19:35:22,824 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-15 19:35:22,824 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-10-15 19:35:22,824 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1743966577] [2021-10-15 19:35:22,825 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-10-15 19:35:22,825 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-15 19:35:22,826 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-10-15 19:35:22,826 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2021-10-15 19:35:22,827 INFO L87 Difference]: Start difference. First operand 810 states and 1089 transitions. Second operand has 8 states, 8 states have (on average 4.0) internal successors, (32), 4 states have internal predecessors, (32), 2 states have call successors, (6), 6 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2021-10-15 19:35:24,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-15 19:35:24,463 INFO L93 Difference]: Finished difference Result 835 states and 1118 transitions. [2021-10-15 19:35:24,463 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-10-15 19:35:24,463 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.0) internal successors, (32), 4 states have internal predecessors, (32), 2 states have call successors, (6), 6 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) Word has length 42 [2021-10-15 19:35:24,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-15 19:35:24,469 INFO L225 Difference]: With dead ends: 835 [2021-10-15 19:35:24,469 INFO L226 Difference]: Without dead ends: 835 [2021-10-15 19:35:24,469 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 361.3ms TimeCoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2021-10-15 19:35:24,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 835 states. [2021-10-15 19:35:24,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 835 to 812. [2021-10-15 19:35:24,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 812 states, 644 states have (on average 1.3276397515527951) internal successors, (855), 655 states have internal predecessors, (855), 96 states have call successors, (96), 61 states have call predecessors, (96), 71 states have return successors, (140), 97 states have call predecessors, (140), 88 states have call successors, (140) [2021-10-15 19:35:24,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 812 states to 812 states and 1091 transitions. [2021-10-15 19:35:24,497 INFO L78 Accepts]: Start accepts. Automaton has 812 states and 1091 transitions. Word has length 42 [2021-10-15 19:35:24,497 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-15 19:35:24,497 INFO L470 AbstractCegarLoop]: Abstraction has 812 states and 1091 transitions. [2021-10-15 19:35:24,497 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.0) internal successors, (32), 4 states have internal predecessors, (32), 2 states have call successors, (6), 6 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2021-10-15 19:35:24,497 INFO L276 IsEmpty]: Start isEmpty. Operand 812 states and 1091 transitions. [2021-10-15 19:35:24,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2021-10-15 19:35:24,499 INFO L504 BasicCegarLoop]: Found error trace [2021-10-15 19:35:24,499 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] [2021-10-15 19:35:24,499 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-10-15 19:35:24,499 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2021-10-15 19:35:24,500 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-15 19:35:24,500 INFO L82 PathProgramCache]: Analyzing trace with hash -211337402, now seen corresponding path program 1 times [2021-10-15 19:35:24,500 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-15 19:35:24,500 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [375111629] [2021-10-15 19:35:24,501 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-15 19:35:24,501 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-15 19:35:24,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-15 19:35:24,634 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-10-15 19:35:24,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-15 19:35:24,668 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-10-15 19:35:24,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-15 19:35:24,686 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-10-15 19:35:24,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-15 19:35:24,700 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2021-10-15 19:35:24,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-15 19:35:24,715 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-15 19:35:24,715 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-15 19:35:24,716 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [375111629] [2021-10-15 19:35:24,716 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [375111629] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-15 19:35:24,716 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-15 19:35:24,716 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-10-15 19:35:24,716 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [280605343] [2021-10-15 19:35:24,718 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-10-15 19:35:24,718 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-15 19:35:24,719 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-10-15 19:35:24,719 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2021-10-15 19:35:24,719 INFO L87 Difference]: Start difference. First operand 812 states and 1091 transitions. Second operand has 9 states, 9 states have (on average 3.5555555555555554) internal successors, (32), 4 states have internal predecessors, (32), 2 states have call successors, (8), 6 states have call predecessors, (8), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2021-10-15 19:35:26,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-15 19:35:26,547 INFO L93 Difference]: Finished difference Result 840 states and 1124 transitions. [2021-10-15 19:35:26,548 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-10-15 19:35:26,549 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.5555555555555554) internal successors, (32), 4 states have internal predecessors, (32), 2 states have call successors, (8), 6 states have call predecessors, (8), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) Word has length 44 [2021-10-15 19:35:26,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-15 19:35:26,555 INFO L225 Difference]: With dead ends: 840 [2021-10-15 19:35:26,556 INFO L226 Difference]: Without dead ends: 840 [2021-10-15 19:35:26,556 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 224.6ms TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2021-10-15 19:35:26,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 840 states. [2021-10-15 19:35:26,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 840 to 816. [2021-10-15 19:35:26,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 816 states, 647 states have (on average 1.3261205564142196) internal successors, (858), 658 states have internal predecessors, (858), 96 states have call successors, (96), 61 states have call predecessors, (96), 72 states have return successors, (142), 98 states have call predecessors, (142), 88 states have call successors, (142) [2021-10-15 19:35:26,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 816 states to 816 states and 1096 transitions. [2021-10-15 19:35:26,592 INFO L78 Accepts]: Start accepts. Automaton has 816 states and 1096 transitions. Word has length 44 [2021-10-15 19:35:26,592 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-15 19:35:26,592 INFO L470 AbstractCegarLoop]: Abstraction has 816 states and 1096 transitions. [2021-10-15 19:35:26,593 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.5555555555555554) internal successors, (32), 4 states have internal predecessors, (32), 2 states have call successors, (8), 6 states have call predecessors, (8), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2021-10-15 19:35:26,593 INFO L276 IsEmpty]: Start isEmpty. Operand 816 states and 1096 transitions. [2021-10-15 19:35:26,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2021-10-15 19:35:26,595 INFO L504 BasicCegarLoop]: Found error trace [2021-10-15 19:35:26,595 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] [2021-10-15 19:35:26,595 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-10-15 19:35:26,595 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2021-10-15 19:35:26,596 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-15 19:35:26,596 INFO L82 PathProgramCache]: Analyzing trace with hash 114455309, now seen corresponding path program 1 times [2021-10-15 19:35:26,596 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-15 19:35:26,597 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [51220357] [2021-10-15 19:35:26,597 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-15 19:35:26,597 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-15 19:35:26,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-15 19:35:26,729 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-10-15 19:35:26,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-15 19:35:26,769 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-10-15 19:35:26,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-15 19:35:26,790 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-10-15 19:35:26,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-15 19:35:26,809 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-10-15 19:35:26,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-15 19:35:26,870 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-15 19:35:26,871 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-15 19:35:26,871 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [51220357] [2021-10-15 19:35:26,871 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [51220357] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-15 19:35:26,871 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-15 19:35:26,872 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-10-15 19:35:26,872 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [627858000] [2021-10-15 19:35:26,872 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-10-15 19:35:26,873 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-15 19:35:26,873 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-10-15 19:35:26,873 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2021-10-15 19:35:26,874 INFO L87 Difference]: Start difference. First operand 816 states and 1096 transitions. Second operand has 8 states, 8 states have (on average 4.125) internal successors, (33), 4 states have internal predecessors, (33), 2 states have call successors, (6), 6 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2021-10-15 19:35:28,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-15 19:35:28,128 INFO L93 Difference]: Finished difference Result 838 states and 1121 transitions. [2021-10-15 19:35:28,128 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-10-15 19:35:28,128 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.125) internal successors, (33), 4 states have internal predecessors, (33), 2 states have call successors, (6), 6 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) Word has length 43 [2021-10-15 19:35:28,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-15 19:35:28,134 INFO L225 Difference]: With dead ends: 838 [2021-10-15 19:35:28,135 INFO L226 Difference]: Without dead ends: 838 [2021-10-15 19:35:28,135 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 366.0ms TimeCoverageRelationStatistics Valid=53, Invalid=103, Unknown=0, NotChecked=0, Total=156 [2021-10-15 19:35:28,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 838 states. [2021-10-15 19:35:28,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 838 to 816. [2021-10-15 19:35:28,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 816 states, 647 states have (on average 1.3261205564142196) internal successors, (858), 658 states have internal predecessors, (858), 96 states have call successors, (96), 61 states have call predecessors, (96), 72 states have return successors, (142), 98 states have call predecessors, (142), 88 states have call successors, (142) [2021-10-15 19:35:28,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 816 states to 816 states and 1096 transitions. [2021-10-15 19:35:28,169 INFO L78 Accepts]: Start accepts. Automaton has 816 states and 1096 transitions. Word has length 43 [2021-10-15 19:35:28,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-15 19:35:28,169 INFO L470 AbstractCegarLoop]: Abstraction has 816 states and 1096 transitions. [2021-10-15 19:35:28,170 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.125) internal successors, (33), 4 states have internal predecessors, (33), 2 states have call successors, (6), 6 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2021-10-15 19:35:28,170 INFO L276 IsEmpty]: Start isEmpty. Operand 816 states and 1096 transitions. [2021-10-15 19:35:28,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2021-10-15 19:35:28,172 INFO L504 BasicCegarLoop]: Found error trace [2021-10-15 19:35:28,172 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-15 19:35:28,173 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-10-15 19:35:28,173 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2021-10-15 19:35:28,173 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-15 19:35:28,174 INFO L82 PathProgramCache]: Analyzing trace with hash 1730277995, now seen corresponding path program 1 times [2021-10-15 19:35:28,174 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-15 19:35:28,174 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [185153061] [2021-10-15 19:35:28,175 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-15 19:35:28,175 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-15 19:35:28,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-15 19:35:28,332 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-10-15 19:35:28,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-15 19:35:28,370 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-10-15 19:35:28,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-15 19:35:28,408 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-10-15 19:35:28,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-15 19:35:28,429 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-10-15 19:35:28,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-15 19:35:28,470 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-10-15 19:35:28,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-15 19:35:28,474 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-15 19:35:28,475 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-15 19:35:28,475 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [185153061] [2021-10-15 19:35:28,475 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [185153061] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-15 19:35:28,475 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-15 19:35:28,476 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-10-15 19:35:28,476 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1553884226] [2021-10-15 19:35:28,476 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-10-15 19:35:28,477 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-15 19:35:28,477 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-10-15 19:35:28,478 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2021-10-15 19:35:28,478 INFO L87 Difference]: Start difference. First operand 816 states and 1096 transitions. Second operand has 10 states, 10 states have (on average 3.3) internal successors, (33), 4 states have internal predecessors, (33), 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-15 19:35:30,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-15 19:35:30,014 INFO L93 Difference]: Finished difference Result 858 states and 1146 transitions. [2021-10-15 19:35:30,014 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-10-15 19:35:30,015 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.3) internal successors, (33), 4 states have internal predecessors, (33), 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 45 [2021-10-15 19:35:30,015 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-15 19:35:30,020 INFO L225 Difference]: With dead ends: 858 [2021-10-15 19:35:30,020 INFO L226 Difference]: Without dead ends: 843 [2021-10-15 19:35:30,023 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 191.0ms TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2021-10-15 19:35:30,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 843 states. [2021-10-15 19:35:30,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 843 to 814. [2021-10-15 19:35:30,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 814 states, 646 states have (on average 1.325077399380805) internal successors, (856), 657 states have internal predecessors, (856), 95 states have call successors, (95), 61 states have call predecessors, (95), 72 states have return successors, (141), 97 states have call predecessors, (141), 87 states have call successors, (141) [2021-10-15 19:35:30,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 814 states to 814 states and 1092 transitions. [2021-10-15 19:35:30,049 INFO L78 Accepts]: Start accepts. Automaton has 814 states and 1092 transitions. Word has length 45 [2021-10-15 19:35:30,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-15 19:35:30,049 INFO L470 AbstractCegarLoop]: Abstraction has 814 states and 1092 transitions. [2021-10-15 19:35:30,050 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.3) internal successors, (33), 4 states have internal predecessors, (33), 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-15 19:35:30,050 INFO L276 IsEmpty]: Start isEmpty. Operand 814 states and 1092 transitions. [2021-10-15 19:35:30,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2021-10-15 19:35:30,052 INFO L504 BasicCegarLoop]: Found error trace [2021-10-15 19:35:30,053 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-15 19:35:30,053 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-10-15 19:35:30,053 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2021-10-15 19:35:30,054 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-15 19:35:30,054 INFO L82 PathProgramCache]: Analyzing trace with hash -645503113, now seen corresponding path program 1 times [2021-10-15 19:35:30,054 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-15 19:35:30,056 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [727690077] [2021-10-15 19:35:30,057 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-15 19:35:30,057 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-15 19:35:30,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-15 19:35:30,187 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-10-15 19:35:30,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-15 19:35:30,219 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-10-15 19:35:30,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-15 19:35:30,237 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-10-15 19:35:30,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-15 19:35:30,254 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-10-15 19:35:30,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-15 19:35:30,281 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-10-15 19:35:30,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-15 19:35:30,301 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-15 19:35:30,301 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-15 19:35:30,301 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [727690077] [2021-10-15 19:35:30,304 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [727690077] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-15 19:35:30,304 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-15 19:35:30,304 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-10-15 19:35:30,305 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2040317209] [2021-10-15 19:35:30,305 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-10-15 19:35:30,305 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-15 19:35:30,306 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-10-15 19:35:30,306 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2021-10-15 19:35:30,306 INFO L87 Difference]: Start difference. First operand 814 states and 1092 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-15 19:35:31,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-15 19:35:31,778 INFO L93 Difference]: Finished difference Result 855 states and 1136 transitions. [2021-10-15 19:35:31,779 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-10-15 19:35:31,779 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-15 19:35:31,780 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-15 19:35:31,785 INFO L225 Difference]: With dead ends: 855 [2021-10-15 19:35:31,785 INFO L226 Difference]: Without dead ends: 804 [2021-10-15 19:35:31,786 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 237.8ms TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2021-10-15 19:35:31,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 804 states. [2021-10-15 19:35:31,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 804 to 775. [2021-10-15 19:35:31,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 775 states, 616 states have (on average 1.3246753246753247) internal successors, (816), 628 states have internal predecessors, (816), 93 states have call successors, (93), 60 states have call predecessors, (93), 65 states have return successors, (132), 88 states have call predecessors, (132), 85 states have call successors, (132) [2021-10-15 19:35:31,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 775 states to 775 states and 1041 transitions. [2021-10-15 19:35:31,815 INFO L78 Accepts]: Start accepts. Automaton has 775 states and 1041 transitions. Word has length 46 [2021-10-15 19:35:31,815 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-15 19:35:31,815 INFO L470 AbstractCegarLoop]: Abstraction has 775 states and 1041 transitions. [2021-10-15 19:35:31,816 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-15 19:35:31,816 INFO L276 IsEmpty]: Start isEmpty. Operand 775 states and 1041 transitions. [2021-10-15 19:35:31,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2021-10-15 19:35:31,817 INFO L504 BasicCegarLoop]: Found error trace [2021-10-15 19:35:31,818 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-15 19:35:31,818 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-10-15 19:35:31,818 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2021-10-15 19:35:31,819 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-15 19:35:31,819 INFO L82 PathProgramCache]: Analyzing trace with hash 1178138073, now seen corresponding path program 1 times [2021-10-15 19:35:31,819 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-15 19:35:31,819 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [852561746] [2021-10-15 19:35:31,819 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-15 19:35:31,820 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-15 19:35:31,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-15 19:35:31,943 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-10-15 19:35:31,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-15 19:35:31,977 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-10-15 19:35:31,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-15 19:35:31,996 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-10-15 19:35:31,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-15 19:35:32,011 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2021-10-15 19:35:32,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-15 19:35:32,016 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-15 19:35:32,016 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-15 19:35:32,017 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [852561746] [2021-10-15 19:35:32,017 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [852561746] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-15 19:35:32,017 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-15 19:35:32,017 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-10-15 19:35:32,017 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1478958068] [2021-10-15 19:35:32,018 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-10-15 19:35:32,018 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-15 19:35:32,019 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-10-15 19:35:32,019 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2021-10-15 19:35:32,020 INFO L87 Difference]: Start difference. First operand 775 states and 1041 transitions. Second operand has 7 states, 7 states have (on average 5.0) internal successors, (35), 3 states have internal predecessors, (35), 2 states have call successors, (8), 6 states have call predecessors, (8), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2021-10-15 19:35:33,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-15 19:35:33,761 INFO L93 Difference]: Finished difference Result 1131 states and 1528 transitions. [2021-10-15 19:35:33,761 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-10-15 19:35:33,761 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.0) internal successors, (35), 3 states have internal predecessors, (35), 2 states have call successors, (8), 6 states have call predecessors, (8), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 47 [2021-10-15 19:35:33,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-15 19:35:33,767 INFO L225 Difference]: With dead ends: 1131 [2021-10-15 19:35:33,767 INFO L226 Difference]: Without dead ends: 1131 [2021-10-15 19:35:33,768 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 256.2ms TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2021-10-15 19:35:33,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1131 states. [2021-10-15 19:35:33,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1131 to 888. [2021-10-15 19:35:33,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 888 states, 707 states have (on average 1.3295615275813295) internal successors, (940), 721 states have internal predecessors, (940), 103 states have call successors, (103), 70 states have call predecessors, (103), 77 states have return successors, (152), 98 states have call predecessors, (152), 95 states have call successors, (152) [2021-10-15 19:35:33,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 888 states to 888 states and 1195 transitions. [2021-10-15 19:35:33,803 INFO L78 Accepts]: Start accepts. Automaton has 888 states and 1195 transitions. Word has length 47 [2021-10-15 19:35:33,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-15 19:35:33,803 INFO L470 AbstractCegarLoop]: Abstraction has 888 states and 1195 transitions. [2021-10-15 19:35:33,804 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.0) internal successors, (35), 3 states have internal predecessors, (35), 2 states have call successors, (8), 6 states have call predecessors, (8), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2021-10-15 19:35:33,804 INFO L276 IsEmpty]: Start isEmpty. Operand 888 states and 1195 transitions. [2021-10-15 19:35:33,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2021-10-15 19:35:33,805 INFO L504 BasicCegarLoop]: Found error trace [2021-10-15 19:35:33,805 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-15 19:35:33,806 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-10-15 19:35:33,806 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2021-10-15 19:35:33,806 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-15 19:35:33,807 INFO L82 PathProgramCache]: Analyzing trace with hash 1451715450, now seen corresponding path program 1 times [2021-10-15 19:35:33,807 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-15 19:35:33,807 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1814177299] [2021-10-15 19:35:33,807 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-15 19:35:33,807 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-15 19:35:33,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-15 19:35:33,928 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-10-15 19:35:33,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-15 19:35:33,961 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-10-15 19:35:33,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-15 19:35:33,980 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-10-15 19:35:33,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-15 19:35:34,006 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-10-15 19:35:34,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-15 19:35:34,031 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-10-15 19:35:34,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-15 19:35:34,034 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-15 19:35:34,034 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-15 19:35:34,034 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1814177299] [2021-10-15 19:35:34,035 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1814177299] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-15 19:35:34,035 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-15 19:35:34,035 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-10-15 19:35:34,035 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2238450] [2021-10-15 19:35:34,037 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-10-15 19:35:34,038 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-15 19:35:34,038 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-10-15 19:35:34,038 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2021-10-15 19:35:34,039 INFO L87 Difference]: Start difference. First operand 888 states and 1195 transitions. Second operand has 10 states, 10 states have (on average 3.5) internal successors, (35), 4 states have internal predecessors, (35), 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-15 19:35:35,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-15 19:35:35,184 INFO L93 Difference]: Finished difference Result 930 states and 1245 transitions. [2021-10-15 19:35:35,185 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-10-15 19:35:35,185 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.5) internal successors, (35), 4 states have internal predecessors, (35), 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 47 [2021-10-15 19:35:35,186 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-15 19:35:35,190 INFO L225 Difference]: With dead ends: 930 [2021-10-15 19:35:35,190 INFO L226 Difference]: Without dead ends: 915 [2021-10-15 19:35:35,191 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 159.9ms TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2021-10-15 19:35:35,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 915 states. [2021-10-15 19:35:35,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 915 to 886. [2021-10-15 19:35:35,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 886 states, 706 states have (on average 1.3286118980169972) internal successors, (938), 720 states have internal predecessors, (938), 102 states have call successors, (102), 70 states have call predecessors, (102), 77 states have return successors, (151), 97 states have call predecessors, (151), 94 states have call successors, (151) [2021-10-15 19:35:35,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 886 states to 886 states and 1191 transitions. [2021-10-15 19:35:35,218 INFO L78 Accepts]: Start accepts. Automaton has 886 states and 1191 transitions. Word has length 47 [2021-10-15 19:35:35,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-15 19:35:35,218 INFO L470 AbstractCegarLoop]: Abstraction has 886 states and 1191 transitions. [2021-10-15 19:35:35,218 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.5) internal successors, (35), 4 states have internal predecessors, (35), 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-15 19:35:35,219 INFO L276 IsEmpty]: Start isEmpty. Operand 886 states and 1191 transitions. [2021-10-15 19:35:35,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2021-10-15 19:35:35,220 INFO L504 BasicCegarLoop]: Found error trace [2021-10-15 19:35:35,221 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-15 19:35:35,221 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2021-10-15 19:35:35,221 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2021-10-15 19:35:35,222 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-15 19:35:35,222 INFO L82 PathProgramCache]: Analyzing trace with hash 1924484230, now seen corresponding path program 1 times [2021-10-15 19:35:35,222 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-15 19:35:35,222 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1605207983] [2021-10-15 19:35:35,222 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-15 19:35:35,223 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-15 19:35:35,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-15 19:35:35,412 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-10-15 19:35:35,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-15 19:35:35,460 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-10-15 19:35:35,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-15 19:35:35,496 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-10-15 19:35:35,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-15 19:35:35,539 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2021-10-15 19:35:35,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-15 19:35:35,546 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-15 19:35:35,546 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-15 19:35:35,546 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1605207983] [2021-10-15 19:35:35,547 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1605207983] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-15 19:35:35,547 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-15 19:35:35,547 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-10-15 19:35:35,547 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2061659195] [2021-10-15 19:35:35,548 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-10-15 19:35:35,548 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-15 19:35:35,549 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-10-15 19:35:35,549 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2021-10-15 19:35:35,550 INFO L87 Difference]: Start difference. First operand 886 states and 1191 transitions. Second operand has 10 states, 10 states have (on average 3.6) internal successors, (36), 6 states have internal predecessors, (36), 4 states have call successors, (8), 7 states have call predecessors, (8), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2021-10-15 19:35:37,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-15 19:35:37,664 INFO L93 Difference]: Finished difference Result 936 states and 1237 transitions. [2021-10-15 19:35:37,664 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-10-15 19:35:37,665 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.6) internal successors, (36), 6 states have internal predecessors, (36), 4 states have call successors, (8), 7 states have call predecessors, (8), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 48 [2021-10-15 19:35:37,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-15 19:35:37,671 INFO L225 Difference]: With dead ends: 936 [2021-10-15 19:35:37,671 INFO L226 Difference]: Without dead ends: 936 [2021-10-15 19:35:37,672 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 617.9ms TimeCoverageRelationStatistics Valid=84, Invalid=188, Unknown=0, NotChecked=0, Total=272 [2021-10-15 19:35:37,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 936 states. [2021-10-15 19:35:37,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 936 to 877. [2021-10-15 19:35:37,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 877 states, 697 states have (on average 1.3156384505021521) internal successors, (917), 711 states have internal predecessors, (917), 102 states have call successors, (102), 70 states have call predecessors, (102), 77 states have return successors, (151), 97 states have call predecessors, (151), 94 states have call successors, (151) [2021-10-15 19:35:37,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 877 states to 877 states and 1170 transitions. [2021-10-15 19:35:37,707 INFO L78 Accepts]: Start accepts. Automaton has 877 states and 1170 transitions. Word has length 48 [2021-10-15 19:35:37,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-15 19:35:37,707 INFO L470 AbstractCegarLoop]: Abstraction has 877 states and 1170 transitions. [2021-10-15 19:35:37,708 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.6) internal successors, (36), 6 states have internal predecessors, (36), 4 states have call successors, (8), 7 states have call predecessors, (8), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2021-10-15 19:35:37,708 INFO L276 IsEmpty]: Start isEmpty. Operand 877 states and 1170 transitions. [2021-10-15 19:35:37,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2021-10-15 19:35:37,710 INFO L504 BasicCegarLoop]: Found error trace [2021-10-15 19:35:37,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] [2021-10-15 19:35:37,710 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2021-10-15 19:35:37,711 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2021-10-15 19:35:37,711 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-15 19:35:37,711 INFO L82 PathProgramCache]: Analyzing trace with hash -398461437, now seen corresponding path program 1 times [2021-10-15 19:35:37,712 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-15 19:35:37,712 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1595562213] [2021-10-15 19:35:37,712 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-15 19:35:37,713 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-15 19:35:37,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-15 19:35:37,893 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-10-15 19:35:37,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-15 19:35:37,931 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-10-15 19:35:37,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-15 19:35:37,961 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-10-15 19:35:37,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-15 19:35:37,986 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-10-15 19:35:37,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-15 19:35:38,047 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-10-15 19:35:38,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-15 19:35:38,075 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-15 19:35:38,075 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-15 19:35:38,075 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1595562213] [2021-10-15 19:35:38,075 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1595562213] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-15 19:35:38,075 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-15 19:35:38,076 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-10-15 19:35:38,076 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1554859869] [2021-10-15 19:35:38,076 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-10-15 19:35:38,077 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-15 19:35:38,077 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-10-15 19:35:38,077 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2021-10-15 19:35:38,078 INFO L87 Difference]: Start difference. First operand 877 states and 1170 transitions. Second operand has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 7 states have internal predecessors, (38), 4 states have call successors, (7), 7 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-15 19:35:40,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-15 19:35:40,949 INFO L93 Difference]: Finished difference Result 1075 states and 1432 transitions. [2021-10-15 19:35:40,949 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2021-10-15 19:35:40,949 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 7 states have internal predecessors, (38), 4 states have call successors, (7), 7 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-15 19:35:40,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-15 19:35:40,953 INFO L225 Difference]: With dead ends: 1075 [2021-10-15 19:35:40,954 INFO L226 Difference]: Without dead ends: 1075 [2021-10-15 19:35:40,954 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 132 ImplicationChecksByTransitivity, 908.5ms TimeCoverageRelationStatistics Valid=184, Invalid=572, Unknown=0, NotChecked=0, Total=756 [2021-10-15 19:35:40,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1075 states. [2021-10-15 19:35:40,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1075 to 932. [2021-10-15 19:35:40,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 932 states, 741 states have (on average 1.3090418353576248) internal successors, (970), 757 states have internal predecessors, (970), 105 states have call successors, (105), 71 states have call predecessors, (105), 85 states have return successors, (168), 104 states have call predecessors, (168), 97 states have call successors, (168) [2021-10-15 19:35:40,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 932 states to 932 states and 1243 transitions. [2021-10-15 19:35:40,983 INFO L78 Accepts]: Start accepts. Automaton has 932 states and 1243 transitions. Word has length 50 [2021-10-15 19:35:40,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-15 19:35:40,983 INFO L470 AbstractCegarLoop]: Abstraction has 932 states and 1243 transitions. [2021-10-15 19:35:40,983 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 7 states have internal predecessors, (38), 4 states have call successors, (7), 7 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-15 19:35:40,984 INFO L276 IsEmpty]: Start isEmpty. Operand 932 states and 1243 transitions. [2021-10-15 19:35:40,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2021-10-15 19:35:40,985 INFO L504 BasicCegarLoop]: Found error trace [2021-10-15 19:35:40,985 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-15 19:35:40,986 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2021-10-15 19:35:40,986 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2021-10-15 19:35:40,986 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-15 19:35:40,987 INFO L82 PathProgramCache]: Analyzing trace with hash 1946804572, now seen corresponding path program 1 times [2021-10-15 19:35:40,987 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-15 19:35:40,987 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1219102013] [2021-10-15 19:35:40,987 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-15 19:35:40,988 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-15 19:35:41,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-15 19:35:41,143 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-10-15 19:35:41,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-15 19:35:41,182 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-10-15 19:35:41,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-15 19:35:41,205 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-10-15 19:35:41,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-15 19:35:41,227 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-10-15 19:35:41,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-15 19:35:41,272 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2021-10-15 19:35:41,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-15 19:35:41,278 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-15 19:35:41,278 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-15 19:35:41,278 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1219102013] [2021-10-15 19:35:41,279 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1219102013] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-15 19:35:41,279 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-15 19:35:41,279 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-10-15 19:35:41,279 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [636046203] [2021-10-15 19:35:41,280 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-10-15 19:35:41,281 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-15 19:35:41,282 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-10-15 19:35:41,282 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2021-10-15 19:35:41,283 INFO L87 Difference]: Start difference. First operand 932 states and 1243 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-15 19:35:42,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-15 19:35:42,799 INFO L93 Difference]: Finished difference Result 976 states and 1293 transitions. [2021-10-15 19:35:42,799 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-10-15 19:35:42,799 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-15 19:35:42,800 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-15 19:35:42,804 INFO L225 Difference]: With dead ends: 976 [2021-10-15 19:35:42,804 INFO L226 Difference]: Without dead ends: 959 [2021-10-15 19:35:42,804 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 337.4ms TimeCoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2021-10-15 19:35:42,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 959 states. [2021-10-15 19:35:42,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 959 to 932. [2021-10-15 19:35:42,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 932 states, 741 states have (on average 1.2928475033738192) internal successors, (958), 757 states have internal predecessors, (958), 105 states have call successors, (105), 71 states have call predecessors, (105), 85 states have return successors, (168), 104 states have call predecessors, (168), 97 states have call successors, (168) [2021-10-15 19:35:42,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 932 states to 932 states and 1231 transitions. [2021-10-15 19:35:42,835 INFO L78 Accepts]: Start accepts. Automaton has 932 states and 1231 transitions. Word has length 50 [2021-10-15 19:35:42,835 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-15 19:35:42,836 INFO L470 AbstractCegarLoop]: Abstraction has 932 states and 1231 transitions. [2021-10-15 19:35:42,836 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-15 19:35:42,836 INFO L276 IsEmpty]: Start isEmpty. Operand 932 states and 1231 transitions. [2021-10-15 19:35:42,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2021-10-15 19:35:42,838 INFO L504 BasicCegarLoop]: Found error trace [2021-10-15 19:35:42,839 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-15 19:35:42,839 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2021-10-15 19:35:42,839 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2021-10-15 19:35:42,840 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-15 19:35:42,840 INFO L82 PathProgramCache]: Analyzing trace with hash 764937325, now seen corresponding path program 1 times [2021-10-15 19:35:42,840 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-15 19:35:42,841 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1091663700] [2021-10-15 19:35:42,841 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-15 19:35:42,841 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-15 19:35:42,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-15 19:35:42,975 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-10-15 19:35:42,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-15 19:35:43,008 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-10-15 19:35:43,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-15 19:35:43,026 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-10-15 19:35:43,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-15 19:35:43,041 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2021-10-15 19:35:43,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-15 19:35:43,057 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-15 19:35:43,058 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-15 19:35:43,058 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1091663700] [2021-10-15 19:35:43,058 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1091663700] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-15 19:35:43,058 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-15 19:35:43,059 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-10-15 19:35:43,059 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1217007603] [2021-10-15 19:35:43,059 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-10-15 19:35:43,060 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-15 19:35:43,060 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-10-15 19:35:43,060 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2021-10-15 19:35:43,061 INFO L87 Difference]: Start difference. First operand 932 states and 1231 transitions. Second operand has 8 states, 8 states have (on average 4.875) internal successors, (39), 4 states have internal predecessors, (39), 3 states have call successors, (9), 6 states have call predecessors, (9), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2021-10-15 19:35:44,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-15 19:35:44,406 INFO L93 Difference]: Finished difference Result 685 states and 869 transitions. [2021-10-15 19:35:44,408 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-10-15 19:35:44,409 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), 3 states have call successors, (9), 6 states have call predecessors, (9), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 52 [2021-10-15 19:35:44,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-15 19:35:44,412 INFO L225 Difference]: With dead ends: 685 [2021-10-15 19:35:44,413 INFO L226 Difference]: Without dead ends: 685 [2021-10-15 19:35:44,413 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 384.3ms TimeCoverageRelationStatistics Valid=51, Invalid=105, Unknown=0, NotChecked=0, Total=156 [2021-10-15 19:35:44,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 685 states. [2021-10-15 19:35:44,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 685 to 623. [2021-10-15 19:35:44,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 623 states, 498 states have (on average 1.2751004016064258) internal successors, (635), 509 states have internal predecessors, (635), 71 states have call successors, (71), 46 states have call predecessors, (71), 53 states have return successors, (85), 68 states have call predecessors, (85), 63 states have call successors, (85) [2021-10-15 19:35:44,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 623 states to 623 states and 791 transitions. [2021-10-15 19:35:44,433 INFO L78 Accepts]: Start accepts. Automaton has 623 states and 791 transitions. Word has length 52 [2021-10-15 19:35:44,434 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-15 19:35:44,434 INFO L470 AbstractCegarLoop]: Abstraction has 623 states and 791 transitions. [2021-10-15 19:35:44,434 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), 3 states have call successors, (9), 6 states have call predecessors, (9), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2021-10-15 19:35:44,434 INFO L276 IsEmpty]: Start isEmpty. Operand 623 states and 791 transitions. [2021-10-15 19:35:44,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2021-10-15 19:35:44,436 INFO L504 BasicCegarLoop]: Found error trace [2021-10-15 19:35:44,436 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-15 19:35:44,437 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2021-10-15 19:35:44,437 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2021-10-15 19:35:44,437 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-15 19:35:44,438 INFO L82 PathProgramCache]: Analyzing trace with hash 855475542, now seen corresponding path program 1 times [2021-10-15 19:35:44,438 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-15 19:35:44,438 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [7680797] [2021-10-15 19:35:44,439 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-15 19:35:44,439 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-15 19:35:44,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-15 19:35:44,564 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-10-15 19:35:44,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-15 19:35:44,594 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-10-15 19:35:44,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-15 19:35:44,609 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-10-15 19:35:44,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-15 19:35:44,624 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-10-15 19:35:44,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-15 19:35:44,675 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2021-10-15 19:35:44,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-15 19:35:44,691 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-15 19:35:44,692 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-15 19:35:44,692 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [7680797] [2021-10-15 19:35:44,692 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [7680797] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-15 19:35:44,692 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-15 19:35:44,693 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-10-15 19:35:44,693 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1989688488] [2021-10-15 19:35:44,693 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-10-15 19:35:44,694 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-15 19:35:44,694 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-10-15 19:35:44,694 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2021-10-15 19:35:44,695 INFO L87 Difference]: Start difference. First operand 623 states and 791 transitions. Second operand has 11 states, 11 states have (on average 3.5454545454545454) internal successors, (39), 5 states have internal predecessors, (39), 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-15 19:35:46,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-15 19:35:46,678 INFO L93 Difference]: Finished difference Result 659 states and 834 transitions. [2021-10-15 19:35:46,678 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-10-15 19:35:46,679 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.5454545454545454) internal successors, (39), 5 states have internal predecessors, (39), 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 51 [2021-10-15 19:35:46,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-15 19:35:46,681 INFO L225 Difference]: With dead ends: 659 [2021-10-15 19:35:46,681 INFO L226 Difference]: Without dead ends: 659 [2021-10-15 19:35:46,682 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 441.6ms TimeCoverageRelationStatistics Valid=74, Invalid=232, Unknown=0, NotChecked=0, Total=306 [2021-10-15 19:35:46,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 659 states. [2021-10-15 19:35:46,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 659 to 624. [2021-10-15 19:35:46,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 624 states, 499 states have (on average 1.2745490981963927) internal successors, (636), 509 states have internal predecessors, (636), 71 states have call successors, (71), 46 states have call predecessors, (71), 53 states have return successors, (85), 69 states have call predecessors, (85), 63 states have call successors, (85) [2021-10-15 19:35:46,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 624 states to 624 states and 792 transitions. [2021-10-15 19:35:46,699 INFO L78 Accepts]: Start accepts. Automaton has 624 states and 792 transitions. Word has length 51 [2021-10-15 19:35:46,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-15 19:35:46,699 INFO L470 AbstractCegarLoop]: Abstraction has 624 states and 792 transitions. [2021-10-15 19:35:46,700 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.5454545454545454) internal successors, (39), 5 states have internal predecessors, (39), 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-15 19:35:46,700 INFO L276 IsEmpty]: Start isEmpty. Operand 624 states and 792 transitions. [2021-10-15 19:35:46,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2021-10-15 19:35:46,702 INFO L504 BasicCegarLoop]: Found error trace [2021-10-15 19:35:46,702 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-15 19:35:46,702 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2021-10-15 19:35:46,703 INFO L402 AbstractCegarLoop]: === Iteration 24 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2021-10-15 19:35:46,703 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-15 19:35:46,704 INFO L82 PathProgramCache]: Analyzing trace with hash -69609850, now seen corresponding path program 1 times [2021-10-15 19:35:46,704 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-15 19:35:46,704 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [779459036] [2021-10-15 19:35:46,704 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-15 19:35:46,705 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-15 19:35:46,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-15 19:35:46,843 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-10-15 19:35:46,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-15 19:35:46,873 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-10-15 19:35:46,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-15 19:35:46,894 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-10-15 19:35:46,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-15 19:35:46,913 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-10-15 19:35:46,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-15 19:35:46,968 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2021-10-15 19:35:46,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-15 19:35:46,973 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-15 19:35:46,973 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-15 19:35:46,973 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [779459036] [2021-10-15 19:35:46,974 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [779459036] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-15 19:35:46,974 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-15 19:35:46,974 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-10-15 19:35:46,974 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1477046266] [2021-10-15 19:35:46,975 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-10-15 19:35:46,975 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-15 19:35:46,976 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-10-15 19:35:46,976 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2021-10-15 19:35:46,977 INFO L87 Difference]: Start difference. First operand 624 states and 792 transitions. Second operand has 11 states, 11 states have (on average 3.5454545454545454) internal successors, (39), 5 states have internal predecessors, (39), 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-15 19:35:48,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-15 19:35:48,707 INFO L93 Difference]: Finished difference Result 673 states and 848 transitions. [2021-10-15 19:35:48,708 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-10-15 19:35:48,708 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.5454545454545454) internal successors, (39), 5 states have internal predecessors, (39), 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 51 [2021-10-15 19:35:48,708 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-15 19:35:48,711 INFO L225 Difference]: With dead ends: 673 [2021-10-15 19:35:48,711 INFO L226 Difference]: Without dead ends: 648 [2021-10-15 19:35:48,712 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 331.6ms TimeCoverageRelationStatistics Valid=50, Invalid=160, Unknown=0, NotChecked=0, Total=210 [2021-10-15 19:35:48,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 648 states. [2021-10-15 19:35:48,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 648 to 616. [2021-10-15 19:35:48,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 616 states, 491 states have (on average 1.2688391038696538) internal successors, (623), 501 states have internal predecessors, (623), 71 states have call successors, (71), 46 states have call predecessors, (71), 53 states have return successors, (85), 69 states have call predecessors, (85), 63 states have call successors, (85) [2021-10-15 19:35:48,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 616 states to 616 states and 779 transitions. [2021-10-15 19:35:48,731 INFO L78 Accepts]: Start accepts. Automaton has 616 states and 779 transitions. Word has length 51 [2021-10-15 19:35:48,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-15 19:35:48,732 INFO L470 AbstractCegarLoop]: Abstraction has 616 states and 779 transitions. [2021-10-15 19:35:48,732 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.5454545454545454) internal successors, (39), 5 states have internal predecessors, (39), 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-15 19:35:48,733 INFO L276 IsEmpty]: Start isEmpty. Operand 616 states and 779 transitions. [2021-10-15 19:35:48,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2021-10-15 19:35:48,734 INFO L504 BasicCegarLoop]: Found error trace [2021-10-15 19:35:48,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, 1, 1, 1, 1] [2021-10-15 19:35:48,735 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2021-10-15 19:35:48,735 INFO L402 AbstractCegarLoop]: === Iteration 25 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2021-10-15 19:35:48,736 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-15 19:35:48,736 INFO L82 PathProgramCache]: Analyzing trace with hash -1297164280, now seen corresponding path program 1 times [2021-10-15 19:35:48,736 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-15 19:35:48,736 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1688534018] [2021-10-15 19:35:48,737 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-15 19:35:48,737 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-15 19:35:48,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-15 19:35:48,869 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-10-15 19:35:48,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-15 19:35:48,925 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-10-15 19:35:48,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-15 19:35:48,947 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-10-15 19:35:48,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-15 19:35:48,970 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-10-15 19:35:48,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-15 19:35:49,005 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-10-15 19:35:49,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-15 19:35:49,012 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-15 19:35:49,013 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-15 19:35:49,013 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1688534018] [2021-10-15 19:35:49,013 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1688534018] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-15 19:35:49,013 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-15 19:35:49,013 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-10-15 19:35:49,014 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1809689384] [2021-10-15 19:35:49,014 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-10-15 19:35:49,014 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-15 19:35:49,015 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-10-15 19:35:49,015 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2021-10-15 19:35:49,016 INFO L87 Difference]: Start difference. First operand 616 states and 779 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, (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-15 19:35:50,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-15 19:35:50,450 INFO L93 Difference]: Finished difference Result 850 states and 1092 transitions. [2021-10-15 19:35:50,450 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-10-15 19:35:50,451 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, (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 52 [2021-10-15 19:35:50,451 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-15 19:35:50,456 INFO L225 Difference]: With dead ends: 850 [2021-10-15 19:35:50,456 INFO L226 Difference]: Without dead ends: 832 [2021-10-15 19:35:50,457 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 262.0ms TimeCoverageRelationStatistics Valid=35, Invalid=55, Unknown=0, NotChecked=0, Total=90 [2021-10-15 19:35:50,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 832 states. [2021-10-15 19:35:50,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 832 to 659. [2021-10-15 19:35:50,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 659 states, 527 states have (on average 1.2580645161290323) internal successors, (663), 530 states have internal predecessors, (663), 73 states have call successors, (73), 48 states have call predecessors, (73), 58 states have return successors, (97), 81 states have call predecessors, (97), 65 states have call successors, (97) [2021-10-15 19:35:50,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 659 states to 659 states and 833 transitions. [2021-10-15 19:35:50,478 INFO L78 Accepts]: Start accepts. Automaton has 659 states and 833 transitions. Word has length 52 [2021-10-15 19:35:50,479 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-15 19:35:50,479 INFO L470 AbstractCegarLoop]: Abstraction has 659 states and 833 transitions. [2021-10-15 19:35:50,479 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, (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-15 19:35:50,479 INFO L276 IsEmpty]: Start isEmpty. Operand 659 states and 833 transitions. [2021-10-15 19:35:50,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2021-10-15 19:35:50,481 INFO L504 BasicCegarLoop]: Found error trace [2021-10-15 19:35:50,481 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-15 19:35:50,482 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2021-10-15 19:35:50,482 INFO L402 AbstractCegarLoop]: === Iteration 26 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2021-10-15 19:35:50,482 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-15 19:35:50,483 INFO L82 PathProgramCache]: Analyzing trace with hash 147904264, now seen corresponding path program 1 times [2021-10-15 19:35:50,483 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-15 19:35:50,483 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1088884605] [2021-10-15 19:35:50,483 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-15 19:35:50,484 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-15 19:35:50,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-15 19:35:50,614 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-10-15 19:35:50,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-15 19:35:50,645 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-10-15 19:35:50,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-15 19:35:50,663 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-10-15 19:35:50,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-15 19:35:50,680 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-10-15 19:35:50,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-15 19:35:50,709 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-10-15 19:35:50,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-15 19:35:50,725 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-15 19:35:50,726 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-15 19:35:50,726 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1088884605] [2021-10-15 19:35:50,726 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1088884605] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-15 19:35:50,726 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-15 19:35:50,727 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-10-15 19:35:50,727 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [534845634] [2021-10-15 19:35:50,727 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-10-15 19:35:50,728 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-15 19:35:50,728 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-10-15 19:35:50,728 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2021-10-15 19:35:50,729 INFO L87 Difference]: Start difference. First operand 659 states and 833 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, (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-15 19:35:52,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-15 19:35:52,034 INFO L93 Difference]: Finished difference Result 719 states and 923 transitions. [2021-10-15 19:35:52,034 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-10-15 19:35:52,035 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, (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 52 [2021-10-15 19:35:52,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-15 19:35:52,037 INFO L225 Difference]: With dead ends: 719 [2021-10-15 19:35:52,038 INFO L226 Difference]: Without dead ends: 714 [2021-10-15 19:35:52,038 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 250.3ms TimeCoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2021-10-15 19:35:52,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 714 states. [2021-10-15 19:35:52,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 714 to 666. [2021-10-15 19:35:52,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 666 states, 534 states have (on average 1.2602996254681649) internal successors, (673), 537 states have internal predecessors, (673), 73 states have call successors, (73), 48 states have call predecessors, (73), 58 states have return successors, (97), 81 states have call predecessors, (97), 65 states have call successors, (97) [2021-10-15 19:35:52,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 666 states to 666 states and 843 transitions. [2021-10-15 19:35:52,058 INFO L78 Accepts]: Start accepts. Automaton has 666 states and 843 transitions. Word has length 52 [2021-10-15 19:35:52,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-15 19:35:52,058 INFO L470 AbstractCegarLoop]: Abstraction has 666 states and 843 transitions. [2021-10-15 19:35:52,058 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, (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-15 19:35:52,059 INFO L276 IsEmpty]: Start isEmpty. Operand 666 states and 843 transitions. [2021-10-15 19:35:52,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2021-10-15 19:35:52,060 INFO L504 BasicCegarLoop]: Found error trace [2021-10-15 19:35:52,061 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-15 19:35:52,061 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2021-10-15 19:35:52,061 INFO L402 AbstractCegarLoop]: === Iteration 27 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2021-10-15 19:35:52,062 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-15 19:35:52,062 INFO L82 PathProgramCache]: Analyzing trace with hash -1440443638, now seen corresponding path program 1 times [2021-10-15 19:35:52,062 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-15 19:35:52,062 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1040259773] [2021-10-15 19:35:52,062 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-15 19:35:52,063 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-15 19:35:52,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-15 19:35:52,174 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-10-15 19:35:52,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-15 19:35:52,220 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-10-15 19:35:52,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-15 19:35:52,244 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-10-15 19:35:52,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-15 19:35:52,262 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-10-15 19:35:52,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-15 19:35:52,302 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-10-15 19:35:52,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-15 19:35:52,332 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-15 19:35:52,333 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-15 19:35:52,333 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1040259773] [2021-10-15 19:35:52,333 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1040259773] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-15 19:35:52,333 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-15 19:35:52,334 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-10-15 19:35:52,334 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1917508620] [2021-10-15 19:35:52,334 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-10-15 19:35:52,335 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-15 19:35:52,335 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-10-15 19:35:52,336 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2021-10-15 19:35:52,336 INFO L87 Difference]: Start difference. First operand 666 states and 843 transitions. Second operand has 12 states, 12 states have (on average 3.3333333333333335) internal successors, (40), 7 states have internal predecessors, (40), 4 states have call successors, (7), 7 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-15 19:35:54,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-15 19:35:54,351 INFO L93 Difference]: Finished difference Result 652 states and 822 transitions. [2021-10-15 19:35:54,352 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-10-15 19:35:54,352 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.3333333333333335) internal successors, (40), 7 states have internal predecessors, (40), 4 states have call successors, (7), 7 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 52 [2021-10-15 19:35:54,352 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-15 19:35:54,355 INFO L225 Difference]: With dead ends: 652 [2021-10-15 19:35:54,355 INFO L226 Difference]: Without dead ends: 610 [2021-10-15 19:35:54,356 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 664.3ms TimeCoverageRelationStatistics Valid=121, Invalid=385, Unknown=0, NotChecked=0, Total=506 [2021-10-15 19:35:54,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 610 states. [2021-10-15 19:35:54,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 610 to 575. [2021-10-15 19:35:54,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 575 states, 455 states have (on average 1.2747252747252746) internal successors, (580), 465 states have internal predecessors, (580), 69 states have call successors, (69), 44 states have call predecessors, (69), 50 states have return successors, (82), 66 states have call predecessors, (82), 61 states have call successors, (82) [2021-10-15 19:35:54,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 575 states to 575 states and 731 transitions. [2021-10-15 19:35:54,370 INFO L78 Accepts]: Start accepts. Automaton has 575 states and 731 transitions. Word has length 52 [2021-10-15 19:35:54,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-15 19:35:54,371 INFO L470 AbstractCegarLoop]: Abstraction has 575 states and 731 transitions. [2021-10-15 19:35:54,371 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.3333333333333335) internal successors, (40), 7 states have internal predecessors, (40), 4 states have call successors, (7), 7 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-15 19:35:54,371 INFO L276 IsEmpty]: Start isEmpty. Operand 575 states and 731 transitions. [2021-10-15 19:35:54,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2021-10-15 19:35:54,373 INFO L504 BasicCegarLoop]: Found error trace [2021-10-15 19:35:54,373 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-15 19:35:54,373 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2021-10-15 19:35:54,374 INFO L402 AbstractCegarLoop]: === Iteration 28 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2021-10-15 19:35:54,374 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-15 19:35:54,374 INFO L82 PathProgramCache]: Analyzing trace with hash -1105462305, now seen corresponding path program 1 times [2021-10-15 19:35:54,375 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-15 19:35:54,375 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1754390684] [2021-10-15 19:35:54,375 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-15 19:35:54,375 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-15 19:35:54,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-15 19:35:54,507 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-10-15 19:35:54,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-15 19:35:54,543 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-10-15 19:35:54,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-15 19:35:54,562 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-10-15 19:35:54,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-15 19:35:54,581 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-10-15 19:35:54,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-15 19:35:54,630 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-10-15 19:35:54,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-15 19:35:54,659 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-15 19:35:54,660 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-15 19:35:54,660 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1754390684] [2021-10-15 19:35:54,660 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1754390684] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-15 19:35:54,660 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-15 19:35:54,660 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2021-10-15 19:35:54,661 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [157008134] [2021-10-15 19:35:54,661 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-10-15 19:35:54,661 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-15 19:35:54,662 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-10-15 19:35:54,662 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2021-10-15 19:35:54,663 INFO L87 Difference]: Start difference. First operand 575 states and 731 transitions. Second operand has 13 states, 13 states have (on average 3.1538461538461537) internal successors, (41), 6 states have internal predecessors, (41), 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-15 19:35:56,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-15 19:35:56,688 INFO L93 Difference]: Finished difference Result 606 states and 767 transitions. [2021-10-15 19:35:56,691 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-10-15 19:35:56,691 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 3.1538461538461537) internal successors, (41), 6 states have internal predecessors, (41), 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 53 [2021-10-15 19:35:56,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-15 19:35:56,695 INFO L225 Difference]: With dead ends: 606 [2021-10-15 19:35:56,695 INFO L226 Difference]: Without dead ends: 605 [2021-10-15 19:35:56,696 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 202.2ms TimeCoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2021-10-15 19:35:56,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 605 states. [2021-10-15 19:35:56,708 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 605 to 583. [2021-10-15 19:35:56,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 583 states, 462 states have (on average 1.2705627705627707) internal successors, (587), 472 states have internal predecessors, (587), 69 states have call successors, (69), 44 states have call predecessors, (69), 51 states have return successors, (83), 67 states have call predecessors, (83), 61 states have call successors, (83) [2021-10-15 19:35:56,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 583 states to 583 states and 739 transitions. [2021-10-15 19:35:56,711 INFO L78 Accepts]: Start accepts. Automaton has 583 states and 739 transitions. Word has length 53 [2021-10-15 19:35:56,711 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-15 19:35:56,711 INFO L470 AbstractCegarLoop]: Abstraction has 583 states and 739 transitions. [2021-10-15 19:35:56,712 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 3.1538461538461537) internal successors, (41), 6 states have internal predecessors, (41), 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-15 19:35:56,712 INFO L276 IsEmpty]: Start isEmpty. Operand 583 states and 739 transitions. [2021-10-15 19:35:56,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2021-10-15 19:35:56,713 INFO L504 BasicCegarLoop]: Found error trace [2021-10-15 19:35:56,714 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-15 19:35:56,714 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2021-10-15 19:35:56,714 INFO L402 AbstractCegarLoop]: === Iteration 29 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2021-10-15 19:35:56,714 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-15 19:35:56,715 INFO L82 PathProgramCache]: Analyzing trace with hash -1105739135, now seen corresponding path program 1 times [2021-10-15 19:35:56,715 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-15 19:35:56,715 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1176696536] [2021-10-15 19:35:56,715 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-15 19:35:56,715 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-15 19:35:56,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-15 19:35:56,864 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-10-15 19:35:56,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-15 19:35:56,906 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-10-15 19:35:56,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-15 19:35:56,929 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-10-15 19:35:56,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-15 19:35:56,951 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-10-15 19:35:56,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-15 19:35:57,027 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-10-15 19:35:57,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-15 19:35:57,081 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-15 19:35:57,082 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-15 19:35:57,082 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1176696536] [2021-10-15 19:35:57,082 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1176696536] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-15 19:35:57,082 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-15 19:35:57,083 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2021-10-15 19:35:57,083 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [165307281] [2021-10-15 19:35:57,083 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-10-15 19:35:57,084 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-15 19:35:57,084 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-10-15 19:35:57,084 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2021-10-15 19:35:57,085 INFO L87 Difference]: Start difference. First operand 583 states and 739 transitions. Second operand has 13 states, 13 states have (on average 3.1538461538461537) internal successors, (41), 6 states have internal predecessors, (41), 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-15 19:35:58,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-15 19:35:58,480 INFO L93 Difference]: Finished difference Result 641 states and 820 transitions. [2021-10-15 19:35:58,480 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-10-15 19:35:58,481 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 3.1538461538461537) internal successors, (41), 6 states have internal predecessors, (41), 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 53 [2021-10-15 19:35:58,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-15 19:35:58,483 INFO L225 Difference]: With dead ends: 641 [2021-10-15 19:35:58,483 INFO L226 Difference]: Without dead ends: 629 [2021-10-15 19:35:58,483 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 355.6ms TimeCoverageRelationStatistics Valid=47, Invalid=193, Unknown=0, NotChecked=0, Total=240 [2021-10-15 19:35:58,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 629 states. [2021-10-15 19:35:58,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 629 to 589. [2021-10-15 19:35:58,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 589 states, 467 states have (on average 1.2676659528907923) internal successors, (592), 478 states have internal predecessors, (592), 69 states have call successors, (69), 44 states have call predecessors, (69), 52 states have return successors, (90), 67 states have call predecessors, (90), 61 states have call successors, (90) [2021-10-15 19:35:58,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 589 states to 589 states and 751 transitions. [2021-10-15 19:35:58,497 INFO L78 Accepts]: Start accepts. Automaton has 589 states and 751 transitions. Word has length 53 [2021-10-15 19:35:58,497 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-15 19:35:58,497 INFO L470 AbstractCegarLoop]: Abstraction has 589 states and 751 transitions. [2021-10-15 19:35:58,498 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 3.1538461538461537) internal successors, (41), 6 states have internal predecessors, (41), 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-15 19:35:58,498 INFO L276 IsEmpty]: Start isEmpty. Operand 589 states and 751 transitions. [2021-10-15 19:35:58,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2021-10-15 19:35:58,500 INFO L504 BasicCegarLoop]: Found error trace [2021-10-15 19:35:58,500 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] [2021-10-15 19:35:58,500 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2021-10-15 19:35:58,500 INFO L402 AbstractCegarLoop]: === Iteration 30 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2021-10-15 19:35:58,501 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-15 19:35:58,501 INFO L82 PathProgramCache]: Analyzing trace with hash 1185659497, now seen corresponding path program 1 times [2021-10-15 19:35:58,501 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-15 19:35:58,501 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [606071589] [2021-10-15 19:35:58,501 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-15 19:35:58,502 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-15 19:35:58,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-15 19:35:58,651 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-10-15 19:35:58,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-15 19:35:58,689 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-10-15 19:35:58,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-15 19:35:58,712 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-10-15 19:35:58,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-15 19:35:58,730 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-10-15 19:35:58,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-15 19:35:58,766 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-10-15 19:35:58,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-15 19:35: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-15 19:35:58,773 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-15 19:35:58,774 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [606071589] [2021-10-15 19:35:58,774 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [606071589] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-15 19:35:58,774 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-15 19:35:58,774 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-10-15 19:35:58,775 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1152782024] [2021-10-15 19:35:58,775 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-10-15 19:35:58,775 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-15 19:35:58,776 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-10-15 19:35:58,776 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2021-10-15 19:35:58,776 INFO L87 Difference]: Start difference. First operand 589 states and 751 transitions. Second operand has 10 states, 10 states have (on average 4.2) internal successors, (42), 5 states have internal predecessors, (42), 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-15 19:36:01,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-15 19:36:01,646 INFO L93 Difference]: Finished difference Result 754 states and 980 transitions. [2021-10-15 19:36:01,646 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-10-15 19:36:01,646 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.2) internal successors, (42), 5 states have internal predecessors, (42), 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 54 [2021-10-15 19:36:01,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-15 19:36:01,651 INFO L225 Difference]: With dead ends: 754 [2021-10-15 19:36:01,652 INFO L226 Difference]: Without dead ends: 740 [2021-10-15 19:36:01,652 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 756.3ms TimeCoverageRelationStatistics Valid=115, Invalid=265, Unknown=0, NotChecked=0, Total=380 [2021-10-15 19:36:01,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 740 states. [2021-10-15 19:36:01,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 740 to 573. [2021-10-15 19:36:01,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 573 states, 454 states have (on average 1.2731277533039647) internal successors, (578), 464 states have internal predecessors, (578), 68 states have call successors, (68), 44 states have call predecessors, (68), 50 states have return successors, (81), 65 states have call predecessors, (81), 60 states have call successors, (81) [2021-10-15 19:36:01,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 573 states to 573 states and 727 transitions. [2021-10-15 19:36:01,672 INFO L78 Accepts]: Start accepts. Automaton has 573 states and 727 transitions. Word has length 54 [2021-10-15 19:36:01,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-15 19:36:01,673 INFO L470 AbstractCegarLoop]: Abstraction has 573 states and 727 transitions. [2021-10-15 19:36:01,673 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.2) internal successors, (42), 5 states have internal predecessors, (42), 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-15 19:36:01,674 INFO L276 IsEmpty]: Start isEmpty. Operand 573 states and 727 transitions. [2021-10-15 19:36:01,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2021-10-15 19:36:01,675 INFO L504 BasicCegarLoop]: Found error trace [2021-10-15 19:36:01,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-15 19:36:01,676 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2021-10-15 19:36:01,676 INFO L402 AbstractCegarLoop]: === Iteration 31 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2021-10-15 19:36:01,677 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-15 19:36:01,677 INFO L82 PathProgramCache]: Analyzing trace with hash -1315437004, now seen corresponding path program 1 times [2021-10-15 19:36:01,677 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-15 19:36:01,678 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [18927013] [2021-10-15 19:36:01,678 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-15 19:36:01,678 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-15 19:36:01,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-15 19:36:01,850 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-10-15 19:36:01,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-15 19:36:01,887 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-10-15 19:36:01,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-15 19:36:01,906 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-10-15 19:36:01,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-15 19:36:01,927 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-10-15 19:36:01,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-15 19:36:01,995 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-10-15 19:36:01,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-15 19:36:02,044 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-10-15 19:36:02,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-15 19:36:02,048 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-15 19:36:02,049 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-15 19:36:02,049 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [18927013] [2021-10-15 19:36:02,049 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [18927013] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-15 19:36:02,050 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-15 19:36:02,050 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2021-10-15 19:36:02,050 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [548684964] [2021-10-15 19:36:02,051 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2021-10-15 19:36:02,051 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-15 19:36:02,051 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-10-15 19:36:02,052 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2021-10-15 19:36:02,052 INFO L87 Difference]: Start difference. First operand 573 states and 727 transitions. Second operand has 14 states, 14 states have (on average 2.9285714285714284) internal successors, (41), 6 states have internal predecessors, (41), 2 states have call successors, (8), 8 states have call predecessors, (8), 3 states have return successors, (6), 3 states have call predecessors, (6), 1 states have call successors, (6) [2021-10-15 19:36:03,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-15 19:36:03,461 INFO L93 Difference]: Finished difference Result 605 states and 763 transitions. [2021-10-15 19:36:03,462 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-10-15 19:36:03,462 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.9285714285714284) internal successors, (41), 6 states have internal predecessors, (41), 2 states have call successors, (8), 8 states have call predecessors, (8), 3 states have return successors, (6), 3 states have call predecessors, (6), 1 states have call successors, (6) Word has length 55 [2021-10-15 19:36:03,462 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-15 19:36:03,466 INFO L225 Difference]: With dead ends: 605 [2021-10-15 19:36:03,466 INFO L226 Difference]: Without dead ends: 580 [2021-10-15 19:36:03,467 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 251.1ms TimeCoverageRelationStatistics Valid=44, Invalid=196, Unknown=0, NotChecked=0, Total=240 [2021-10-15 19:36:03,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 580 states. [2021-10-15 19:36:03,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 580 to 561. [2021-10-15 19:36:03,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 561 states, 445 states have (on average 1.2719101123595506) internal successors, (566), 455 states have internal predecessors, (566), 66 states have call successors, (66), 43 states have call predecessors, (66), 49 states have return successors, (79), 63 states have call predecessors, (79), 58 states have call successors, (79) [2021-10-15 19:36:03,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 561 states to 561 states and 711 transitions. [2021-10-15 19:36:03,484 INFO L78 Accepts]: Start accepts. Automaton has 561 states and 711 transitions. Word has length 55 [2021-10-15 19:36:03,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-15 19:36:03,484 INFO L470 AbstractCegarLoop]: Abstraction has 561 states and 711 transitions. [2021-10-15 19:36:03,484 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 2.9285714285714284) internal successors, (41), 6 states have internal predecessors, (41), 2 states have call successors, (8), 8 states have call predecessors, (8), 3 states have return successors, (6), 3 states have call predecessors, (6), 1 states have call successors, (6) [2021-10-15 19:36:03,485 INFO L276 IsEmpty]: Start isEmpty. Operand 561 states and 711 transitions. [2021-10-15 19:36:03,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2021-10-15 19:36:03,487 INFO L504 BasicCegarLoop]: Found error trace [2021-10-15 19:36:03,487 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-15 19:36:03,487 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2021-10-15 19:36:03,488 INFO L402 AbstractCegarLoop]: === Iteration 32 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2021-10-15 19:36:03,488 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-15 19:36:03,488 INFO L82 PathProgramCache]: Analyzing trace with hash -423366039, now seen corresponding path program 1 times [2021-10-15 19:36:03,489 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-15 19:36:03,489 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [171243678] [2021-10-15 19:36:03,489 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-15 19:36:03,489 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-15 19:36:03,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-15 19:36:03,627 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-10-15 19:36:03,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-15 19:36:03,662 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-10-15 19:36:03,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-15 19:36:03,677 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-10-15 19:36:03,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-15 19:36:03,687 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2021-10-15 19:36:03,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-15 19:36:03,691 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-10-15 19:36:03,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-15 19:36:03,700 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2021-10-15 19:36:03,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-15 19:36:03,704 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-15 19:36:03,704 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-15 19:36:03,705 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [171243678] [2021-10-15 19:36:03,705 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [171243678] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-15 19:36:03,705 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-15 19:36:03,705 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-10-15 19:36:03,706 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [603187648] [2021-10-15 19:36:03,706 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-10-15 19:36:03,706 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-15 19:36:03,707 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-10-15 19:36:03,707 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2021-10-15 19:36:03,707 INFO L87 Difference]: Start difference. First operand 561 states and 711 transitions. Second operand has 8 states, 8 states have (on average 5.125) internal successors, (41), 3 states have internal predecessors, (41), 2 states have call successors, (11), 7 states have call predecessors, (11), 2 states have return successors, (6), 2 states have call predecessors, (6), 1 states have call successors, (6) [2021-10-15 19:36:04,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-15 19:36:04,807 INFO L93 Difference]: Finished difference Result 589 states and 746 transitions. [2021-10-15 19:36:04,808 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-10-15 19:36:04,808 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.125) internal successors, (41), 3 states have internal predecessors, (41), 2 states have call successors, (11), 7 states have call predecessors, (11), 2 states have return successors, (6), 2 states have call predecessors, (6), 1 states have call successors, (6) Word has length 58 [2021-10-15 19:36:04,808 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-15 19:36:04,811 INFO L225 Difference]: With dead ends: 589 [2021-10-15 19:36:04,811 INFO L226 Difference]: Without dead ends: 589 [2021-10-15 19:36:04,811 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 242.9ms TimeCoverageRelationStatistics Valid=48, Invalid=84, Unknown=0, NotChecked=0, Total=132 [2021-10-15 19:36:04,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 589 states. [2021-10-15 19:36:04,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 589 to 566. [2021-10-15 19:36:04,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 566 states, 449 states have (on average 1.265033407572383) internal successors, (568), 460 states have internal predecessors, (568), 66 states have call successors, (66), 43 states have call predecessors, (66), 50 states have return successors, (83), 63 states have call predecessors, (83), 58 states have call successors, (83) [2021-10-15 19:36:04,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 566 states to 566 states and 717 transitions. [2021-10-15 19:36:04,827 INFO L78 Accepts]: Start accepts. Automaton has 566 states and 717 transitions. Word has length 58 [2021-10-15 19:36:04,828 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-15 19:36:04,828 INFO L470 AbstractCegarLoop]: Abstraction has 566 states and 717 transitions. [2021-10-15 19:36:04,828 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.125) internal successors, (41), 3 states have internal predecessors, (41), 2 states have call successors, (11), 7 states have call predecessors, (11), 2 states have return successors, (6), 2 states have call predecessors, (6), 1 states have call successors, (6) [2021-10-15 19:36:04,828 INFO L276 IsEmpty]: Start isEmpty. Operand 566 states and 717 transitions. [2021-10-15 19:36:04,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2021-10-15 19:36:04,831 INFO L504 BasicCegarLoop]: Found error trace [2021-10-15 19:36:04,831 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] [2021-10-15 19:36:04,831 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2021-10-15 19:36:04,832 INFO L402 AbstractCegarLoop]: === Iteration 33 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2021-10-15 19:36:04,832 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-15 19:36:04,832 INFO L82 PathProgramCache]: Analyzing trace with hash 178096204, now seen corresponding path program 1 times [2021-10-15 19:36:04,832 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-15 19:36:04,833 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [669369566] [2021-10-15 19:36:04,833 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-15 19:36:04,833 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-15 19:36:04,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-15 19:36:04,989 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-10-15 19:36:04,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-15 19:36:05,026 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-10-15 19:36:05,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-15 19:36:05,042 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-10-15 19:36:05,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-15 19:36:05,055 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2021-10-15 19:36:05,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-15 19:36:05,191 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-10-15 19:36:05,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-15 19:36:05,212 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-10-15 19:36:05,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-15 19:36:05,216 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-15 19:36:05,217 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-15 19:36:05,217 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [669369566] [2021-10-15 19:36:05,217 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [669369566] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-15 19:36:05,217 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-15 19:36:05,218 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-10-15 19:36:05,218 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [394189463] [2021-10-15 19:36:05,218 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-10-15 19:36:05,218 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-15 19:36:05,219 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-10-15 19:36:05,219 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2021-10-15 19:36:05,219 INFO L87 Difference]: Start difference. First operand 566 states and 717 transitions. Second operand has 10 states, 10 states have (on average 4.8) internal successors, (48), 4 states have internal predecessors, (48), 2 states have call successors, (10), 7 states have call predecessors, (10), 3 states have return successors, (6), 3 states have call predecessors, (6), 1 states have call successors, (6) [2021-10-15 19:36:06,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-15 19:36:06,492 INFO L93 Difference]: Finished difference Result 538 states and 675 transitions. [2021-10-15 19:36:06,493 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-10-15 19:36:06,494 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.8) internal successors, (48), 4 states have internal predecessors, (48), 2 states have call successors, (10), 7 states have call predecessors, (10), 3 states have return successors, (6), 3 states have call predecessors, (6), 1 states have call successors, (6) Word has length 64 [2021-10-15 19:36:06,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-15 19:36:06,497 INFO L225 Difference]: With dead ends: 538 [2021-10-15 19:36:06,497 INFO L226 Difference]: Without dead ends: 538 [2021-10-15 19:36:06,498 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 175.8ms TimeCoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2021-10-15 19:36:06,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 538 states. [2021-10-15 19:36:06,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 538 to 511. [2021-10-15 19:36:06,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 511 states, 402 states have (on average 1.2537313432835822) internal successors, (504), 410 states have internal predecessors, (504), 63 states have call successors, (63), 42 states have call predecessors, (63), 45 states have return successors, (72), 59 states have call predecessors, (72), 56 states have call successors, (72) [2021-10-15 19:36:06,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 511 states to 511 states and 639 transitions. [2021-10-15 19:36:06,513 INFO L78 Accepts]: Start accepts. Automaton has 511 states and 639 transitions. Word has length 64 [2021-10-15 19:36:06,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-15 19:36:06,513 INFO L470 AbstractCegarLoop]: Abstraction has 511 states and 639 transitions. [2021-10-15 19:36:06,514 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.8) internal successors, (48), 4 states have internal predecessors, (48), 2 states have call successors, (10), 7 states have call predecessors, (10), 3 states have return successors, (6), 3 states have call predecessors, (6), 1 states have call successors, (6) [2021-10-15 19:36:06,514 INFO L276 IsEmpty]: Start isEmpty. Operand 511 states and 639 transitions. [2021-10-15 19:36:06,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2021-10-15 19:36:06,516 INFO L504 BasicCegarLoop]: Found error trace [2021-10-15 19:36:06,516 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] [2021-10-15 19:36:06,516 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2021-10-15 19:36:06,517 INFO L402 AbstractCegarLoop]: === Iteration 34 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2021-10-15 19:36:06,517 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-15 19:36:06,518 INFO L82 PathProgramCache]: Analyzing trace with hash -464089137, now seen corresponding path program 1 times [2021-10-15 19:36:06,518 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-15 19:36:06,518 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [702569827] [2021-10-15 19:36:06,518 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-15 19:36:06,519 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-15 19:36:06,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-15 19:36:06,684 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-10-15 19:36:06,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-15 19:36:06,728 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-10-15 19:36:06,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-15 19:36:06,745 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-10-15 19:36:06,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-15 19:36:06,763 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-10-15 19:36:06,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-15 19:36:06,841 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2021-10-15 19:36:06,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-15 19:36:06,877 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-10-15 19:36:06,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-15 19:36:06,881 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-15 19:36:06,882 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-15 19:36:06,882 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [702569827] [2021-10-15 19:36:06,882 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [702569827] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-15 19:36:06,882 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-15 19:36:06,883 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2021-10-15 19:36:06,883 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1947559691] [2021-10-15 19:36:06,883 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2021-10-15 19:36:06,884 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-15 19:36:06,884 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-10-15 19:36:06,885 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2021-10-15 19:36:06,885 INFO L87 Difference]: Start difference. First operand 511 states and 639 transitions. Second operand has 14 states, 14 states have (on average 3.2142857142857144) internal successors, (45), 6 states have internal predecessors, (45), 3 states have call successors, (8), 8 states have call predecessors, (8), 3 states have return successors, (6), 4 states have call predecessors, (6), 2 states have call successors, (6) [2021-10-15 19:36:08,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-15 19:36:08,924 INFO L93 Difference]: Finished difference Result 542 states and 675 transitions. [2021-10-15 19:36:08,924 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-10-15 19:36:08,925 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 3.2142857142857144) internal successors, (45), 6 states have internal predecessors, (45), 3 states have call successors, (8), 8 states have call predecessors, (8), 3 states have return successors, (6), 4 states have call predecessors, (6), 2 states have call successors, (6) Word has length 59 [2021-10-15 19:36:08,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-15 19:36:08,928 INFO L225 Difference]: With dead ends: 542 [2021-10-15 19:36:08,929 INFO L226 Difference]: Without dead ends: 524 [2021-10-15 19:36:08,929 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 387.7ms TimeCoverageRelationStatistics Valid=63, Invalid=279, Unknown=0, NotChecked=0, Total=342 [2021-10-15 19:36:08,930 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 524 states. [2021-10-15 19:36:08,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 524 to 508. [2021-10-15 19:36:08,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 508 states, 399 states have (on average 1.255639097744361) internal successors, (501), 408 states have internal predecessors, (501), 63 states have call successors, (63), 42 states have call predecessors, (63), 45 states have return successors, (71), 58 states have call predecessors, (71), 56 states have call successors, (71) [2021-10-15 19:36:08,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 508 states to 508 states and 635 transitions. [2021-10-15 19:36:08,943 INFO L78 Accepts]: Start accepts. Automaton has 508 states and 635 transitions. Word has length 59 [2021-10-15 19:36:08,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-15 19:36:08,944 INFO L470 AbstractCegarLoop]: Abstraction has 508 states and 635 transitions. [2021-10-15 19:36:08,944 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 3.2142857142857144) internal successors, (45), 6 states have internal predecessors, (45), 3 states have call successors, (8), 8 states have call predecessors, (8), 3 states have return successors, (6), 4 states have call predecessors, (6), 2 states have call successors, (6) [2021-10-15 19:36:08,944 INFO L276 IsEmpty]: Start isEmpty. Operand 508 states and 635 transitions. [2021-10-15 19:36:08,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2021-10-15 19:36:08,946 INFO L504 BasicCegarLoop]: Found error trace [2021-10-15 19:36:08,946 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-15 19:36:08,946 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2021-10-15 19:36:08,947 INFO L402 AbstractCegarLoop]: === Iteration 35 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2021-10-15 19:36:08,947 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-15 19:36:08,947 INFO L82 PathProgramCache]: Analyzing trace with hash 462485744, now seen corresponding path program 1 times [2021-10-15 19:36:08,947 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-15 19:36:08,948 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1660788530] [2021-10-15 19:36:08,948 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-15 19:36:08,948 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-15 19:36:08,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-15 19:36:09,093 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-10-15 19:36:09,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-15 19:36:09,131 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-10-15 19:36:09,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-15 19:36:09,153 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-10-15 19:36:09,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-15 19:36:09,179 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-10-15 19:36:09,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-15 19:36:09,231 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-10-15 19:36:09,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-15 19:36:09,265 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-15 19:36:09,265 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-15 19:36:09,265 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1660788530] [2021-10-15 19:36:09,266 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1660788530] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-15 19:36:09,266 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-15 19:36:09,266 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2021-10-15 19:36:09,266 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [278580756] [2021-10-15 19:36:09,267 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-10-15 19:36:09,267 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-15 19:36:09,268 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-10-15 19:36:09,268 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2021-10-15 19:36:09,268 INFO L87 Difference]: Start difference. First operand 508 states and 635 transitions. Second operand has 13 states, 13 states have (on average 3.5384615384615383) internal successors, (46), 6 states have internal predecessors, (46), 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-15 19:36:10,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-15 19:36:10,741 INFO L93 Difference]: Finished difference Result 535 states and 666 transitions. [2021-10-15 19:36:10,741 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-10-15 19:36:10,741 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 3.5384615384615383) internal successors, (46), 6 states have internal predecessors, (46), 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 58 [2021-10-15 19:36:10,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-15 19:36:10,744 INFO L225 Difference]: With dead ends: 535 [2021-10-15 19:36:10,744 INFO L226 Difference]: Without dead ends: 520 [2021-10-15 19:36:10,745 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 237.5ms TimeCoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2021-10-15 19:36:10,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 520 states. [2021-10-15 19:36:10,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 520 to 504. [2021-10-15 19:36:10,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 504 states, 396 states have (on average 1.255050505050505) internal successors, (497), 405 states have internal predecessors, (497), 62 states have call successors, (62), 42 states have call predecessors, (62), 45 states have return successors, (70), 57 states have call predecessors, (70), 55 states have call successors, (70) [2021-10-15 19:36:10,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 504 states to 504 states and 629 transitions. [2021-10-15 19:36:10,758 INFO L78 Accepts]: Start accepts. Automaton has 504 states and 629 transitions. Word has length 58 [2021-10-15 19:36:10,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-15 19:36:10,759 INFO L470 AbstractCegarLoop]: Abstraction has 504 states and 629 transitions. [2021-10-15 19:36:10,759 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 3.5384615384615383) internal successors, (46), 6 states have internal predecessors, (46), 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-15 19:36:10,759 INFO L276 IsEmpty]: Start isEmpty. Operand 504 states and 629 transitions. [2021-10-15 19:36:10,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2021-10-15 19:36:10,761 INFO L504 BasicCegarLoop]: Found error trace [2021-10-15 19:36:10,761 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] [2021-10-15 19:36:10,762 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2021-10-15 19:36:10,762 INFO L402 AbstractCegarLoop]: === Iteration 36 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2021-10-15 19:36:10,762 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-15 19:36:10,763 INFO L82 PathProgramCache]: Analyzing trace with hash -238724580, now seen corresponding path program 1 times [2021-10-15 19:36:10,763 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-15 19:36:10,763 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1791281986] [2021-10-15 19:36:10,763 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-15 19:36:10,763 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-15 19:36:10,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-15 19:36:10,904 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-10-15 19:36:10,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-15 19:36:10,947 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-10-15 19:36:10,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-15 19:36:10,970 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-10-15 19:36:10,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-15 19:36:10,992 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-10-15 19:36:10,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-15 19:36:11,043 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2021-10-15 19:36:11,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-15 19:36:11,058 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2021-10-15 19:36:11,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-15 19:36:11,068 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-15 19:36:11,069 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-15 19:36:11,069 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1791281986] [2021-10-15 19:36:11,069 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1791281986] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-15 19:36:11,069 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-15 19:36:11,070 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-10-15 19:36:11,070 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [395852204] [2021-10-15 19:36:11,070 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-10-15 19:36:11,070 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-15 19:36:11,071 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-10-15 19:36:11,071 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2021-10-15 19:36:11,072 INFO L87 Difference]: Start difference. First operand 504 states and 629 transitions. Second operand has 12 states, 12 states have (on average 3.8333333333333335) internal successors, (46), 5 states have internal predecessors, (46), 3 states have call successors, (8), 8 states have call predecessors, (8), 2 states have return successors, (6), 3 states have call predecessors, (6), 2 states have call successors, (6) [2021-10-15 19:36:12,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-15 19:36:12,587 INFO L93 Difference]: Finished difference Result 536 states and 666 transitions. [2021-10-15 19:36:12,588 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-10-15 19:36:12,589 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.8333333333333335) internal successors, (46), 5 states have internal predecessors, (46), 3 states have call successors, (8), 8 states have call predecessors, (8), 2 states have return successors, (6), 3 states have call predecessors, (6), 2 states have call successors, (6) Word has length 60 [2021-10-15 19:36:12,589 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-15 19:36:12,607 INFO L225 Difference]: With dead ends: 536 [2021-10-15 19:36:12,607 INFO L226 Difference]: Without dead ends: 515 [2021-10-15 19:36:12,607 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 249.8ms TimeCoverageRelationStatistics Valid=48, Invalid=162, Unknown=0, NotChecked=0, Total=210 [2021-10-15 19:36:12,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 515 states. [2021-10-15 19:36:12,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 515 to 499. [2021-10-15 19:36:12,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 499 states, 393 states have (on average 1.251908396946565) internal successors, (492), 401 states have internal predecessors, (492), 61 states have call successors, (61), 42 states have call predecessors, (61), 44 states have return successors, (68), 56 states have call predecessors, (68), 54 states have call successors, (68) [2021-10-15 19:36:12,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 499 states to 499 states and 621 transitions. [2021-10-15 19:36:12,626 INFO L78 Accepts]: Start accepts. Automaton has 499 states and 621 transitions. Word has length 60 [2021-10-15 19:36:12,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-15 19:36:12,626 INFO L470 AbstractCegarLoop]: Abstraction has 499 states and 621 transitions. [2021-10-15 19:36:12,627 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.8333333333333335) internal successors, (46), 5 states have internal predecessors, (46), 3 states have call successors, (8), 8 states have call predecessors, (8), 2 states have return successors, (6), 3 states have call predecessors, (6), 2 states have call successors, (6) [2021-10-15 19:36:12,627 INFO L276 IsEmpty]: Start isEmpty. Operand 499 states and 621 transitions. [2021-10-15 19:36:12,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2021-10-15 19:36:12,630 INFO L504 BasicCegarLoop]: Found error trace [2021-10-15 19:36:12,631 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-15 19:36:12,631 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2021-10-15 19:36:12,631 INFO L402 AbstractCegarLoop]: === Iteration 37 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2021-10-15 19:36:12,632 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-15 19:36:12,632 INFO L82 PathProgramCache]: Analyzing trace with hash -858312845, now seen corresponding path program 1 times [2021-10-15 19:36:12,632 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-15 19:36:12,633 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [281255160] [2021-10-15 19:36:12,633 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-15 19:36:12,633 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-15 19:36:12,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-15 19:36:12,794 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-10-15 19:36:12,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-15 19:36:12,836 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-10-15 19:36:12,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-15 19:36:12,862 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-10-15 19:36:12,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-15 19:36:12,880 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2021-10-15 19:36:12,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-15 19:36:12,937 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-10-15 19:36:12,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-15 19:36:12,942 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-10-15 19:36:12,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-15 19:36:12,959 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-10-15 19:36:12,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-15 19:36:12,975 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-15 19:36:12,976 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-15 19:36:12,976 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [281255160] [2021-10-15 19:36:12,976 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [281255160] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-15 19:36:12,977 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-15 19:36:12,977 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-10-15 19:36:12,977 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [171577802] [2021-10-15 19:36:12,978 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-10-15 19:36:12,979 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-15 19:36:12,979 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-10-15 19:36:12,980 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2021-10-15 19:36:12,980 INFO L87 Difference]: Start difference. First operand 499 states and 621 transitions. Second operand has 12 states, 12 states have (on average 4.166666666666667) internal successors, (50), 6 states have internal predecessors, (50), 3 states have call successors, (11), 9 states have call predecessors, (11), 4 states have return successors, (7), 4 states have call predecessors, (7), 2 states have call successors, (7) [2021-10-15 19:36:14,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-15 19:36:14,805 INFO L93 Difference]: Finished difference Result 521 states and 649 transitions. [2021-10-15 19:36:14,805 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-10-15 19:36:14,805 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 4.166666666666667) internal successors, (50), 6 states have internal predecessors, (50), 3 states have call successors, (11), 9 states have call predecessors, (11), 4 states have return successors, (7), 4 states have call predecessors, (7), 2 states have call successors, (7) Word has length 68 [2021-10-15 19:36:14,806 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-15 19:36:14,809 INFO L225 Difference]: With dead ends: 521 [2021-10-15 19:36:14,809 INFO L226 Difference]: Without dead ends: 521 [2021-10-15 19:36:14,810 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 566.8ms TimeCoverageRelationStatistics Valid=106, Invalid=314, Unknown=0, NotChecked=0, Total=420 [2021-10-15 19:36:14,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 521 states. [2021-10-15 19:36:14,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 521 to 499. [2021-10-15 19:36:14,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 499 states, 393 states have (on average 1.2468193384223918) internal successors, (490), 401 states have internal predecessors, (490), 61 states have call successors, (61), 42 states have call predecessors, (61), 44 states have return successors, (68), 56 states have call predecessors, (68), 54 states have call successors, (68) [2021-10-15 19:36:14,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 499 states to 499 states and 619 transitions. [2021-10-15 19:36:14,823 INFO L78 Accepts]: Start accepts. Automaton has 499 states and 619 transitions. Word has length 68 [2021-10-15 19:36:14,823 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-15 19:36:14,823 INFO L470 AbstractCegarLoop]: Abstraction has 499 states and 619 transitions. [2021-10-15 19:36:14,824 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 4.166666666666667) internal successors, (50), 6 states have internal predecessors, (50), 3 states have call successors, (11), 9 states have call predecessors, (11), 4 states have return successors, (7), 4 states have call predecessors, (7), 2 states have call successors, (7) [2021-10-15 19:36:14,824 INFO L276 IsEmpty]: Start isEmpty. Operand 499 states and 619 transitions. [2021-10-15 19:36:14,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2021-10-15 19:36:14,826 INFO L504 BasicCegarLoop]: Found error trace [2021-10-15 19:36:14,826 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-15 19:36:14,826 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2021-10-15 19:36:14,827 INFO L402 AbstractCegarLoop]: === Iteration 38 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2021-10-15 19:36:14,827 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-15 19:36:14,827 INFO L82 PathProgramCache]: Analyzing trace with hash 1201869596, now seen corresponding path program 1 times [2021-10-15 19:36:14,828 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-15 19:36:14,828 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1170630836] [2021-10-15 19:36:14,828 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-15 19:36:14,828 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-15 19:36:14,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-15 19:36:14,992 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-10-15 19:36:14,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-15 19:36:15,029 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-10-15 19:36:15,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-15 19:36:15,048 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-10-15 19:36:15,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-15 19:36:15,071 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-10-15 19:36:15,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-15 19:36:15,108 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2021-10-15 19:36:15,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-15 19:36:15,133 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-10-15 19:36:15,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-15 19:36:15,151 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-15 19:36:15,152 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-15 19:36:15,152 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1170630836] [2021-10-15 19:36:15,152 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1170630836] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-15 19:36:15,152 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-15 19:36:15,153 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-10-15 19:36:15,153 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [843872270] [2021-10-15 19:36:15,154 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-10-15 19:36:15,155 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-15 19:36:15,155 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-10-15 19:36:15,155 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2021-10-15 19:36:15,156 INFO L87 Difference]: Start difference. First operand 499 states and 619 transitions. Second operand has 10 states, 10 states have (on average 4.9) internal successors, (49), 4 states have internal predecessors, (49), 2 states have call successors, (8), 7 states have call predecessors, (8), 3 states have return successors, (6), 3 states have call predecessors, (6), 1 states have call successors, (6) [2021-10-15 19:36:16,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-15 19:36:16,867 INFO L93 Difference]: Finished difference Result 519 states and 644 transitions. [2021-10-15 19:36:16,867 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-10-15 19:36:16,867 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.9) internal successors, (49), 4 states have internal predecessors, (49), 2 states have call successors, (8), 7 states have call predecessors, (8), 3 states have return successors, (6), 3 states have call predecessors, (6), 1 states have call successors, (6) Word has length 63 [2021-10-15 19:36:16,868 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-15 19:36:16,869 INFO L225 Difference]: With dead ends: 519 [2021-10-15 19:36:16,869 INFO L226 Difference]: Without dead ends: 519 [2021-10-15 19:36:16,870 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 321.5ms TimeCoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2021-10-15 19:36:16,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 519 states. [2021-10-15 19:36:16,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 519 to 503. [2021-10-15 19:36:16,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 503 states, 396 states have (on average 1.244949494949495) internal successors, (493), 404 states have internal predecessors, (493), 61 states have call successors, (61), 42 states have call predecessors, (61), 45 states have return successors, (69), 57 states have call predecessors, (69), 54 states have call successors, (69) [2021-10-15 19:36:16,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 503 states to 503 states and 623 transitions. [2021-10-15 19:36:16,881 INFO L78 Accepts]: Start accepts. Automaton has 503 states and 623 transitions. Word has length 63 [2021-10-15 19:36:16,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-15 19:36:16,881 INFO L470 AbstractCegarLoop]: Abstraction has 503 states and 623 transitions. [2021-10-15 19:36:16,881 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.9) internal successors, (49), 4 states have internal predecessors, (49), 2 states have call successors, (8), 7 states have call predecessors, (8), 3 states have return successors, (6), 3 states have call predecessors, (6), 1 states have call successors, (6) [2021-10-15 19:36:16,882 INFO L276 IsEmpty]: Start isEmpty. Operand 503 states and 623 transitions. [2021-10-15 19:36:16,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2021-10-15 19:36:16,883 INFO L504 BasicCegarLoop]: Found error trace [2021-10-15 19:36:16,884 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-15 19:36:16,884 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2021-10-15 19:36:16,884 INFO L402 AbstractCegarLoop]: === Iteration 39 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2021-10-15 19:36:16,884 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-15 19:36:16,885 INFO L82 PathProgramCache]: Analyzing trace with hash -813300133, now seen corresponding path program 1 times [2021-10-15 19:36:16,885 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-15 19:36:16,885 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1333922854] [2021-10-15 19:36:16,885 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-15 19:36:16,886 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-15 19:36:16,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-15 19:36:17,009 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-10-15 19:36:17,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-15 19:36:17,040 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-10-15 19:36:17,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-15 19:36:17,055 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-10-15 19:36:17,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-15 19:36:17,071 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-10-15 19:36:17,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-15 19:36:17,124 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2021-10-15 19:36:17,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-15 19:36:17,173 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-10-15 19:36:17,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-15 19:36:17,177 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-15 19:36:17,178 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-15 19:36:17,178 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1333922854] [2021-10-15 19:36:17,178 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1333922854] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-15 19:36:17,179 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-15 19:36:17,179 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-10-15 19:36:17,179 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [971169364] [2021-10-15 19:36:17,180 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-10-15 19:36:17,180 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-15 19:36:17,181 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-10-15 19:36:17,181 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2021-10-15 19:36:17,181 INFO L87 Difference]: Start difference. First operand 503 states and 623 transitions. Second operand has 12 states, 12 states have (on average 4.083333333333333) internal successors, (49), 6 states have internal predecessors, (49), 2 states have call successors, (8), 7 states have call predecessors, (8), 3 states have return successors, (6), 3 states have call predecessors, (6), 1 states have call successors, (6) [2021-10-15 19:36:18,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-15 19:36:18,802 INFO L93 Difference]: Finished difference Result 505 states and 625 transitions. [2021-10-15 19:36:18,803 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-10-15 19:36:18,803 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 4.083333333333333) internal successors, (49), 6 states have internal predecessors, (49), 2 states have call successors, (8), 7 states have call predecessors, (8), 3 states have return successors, (6), 3 states have call predecessors, (6), 1 states have call successors, (6) Word has length 63 [2021-10-15 19:36:18,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-15 19:36:18,805 INFO L225 Difference]: With dead ends: 505 [2021-10-15 19:36:18,805 INFO L226 Difference]: Without dead ends: 505 [2021-10-15 19:36:18,805 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 343.2ms TimeCoverageRelationStatistics Valid=61, Invalid=245, Unknown=0, NotChecked=0, Total=306 [2021-10-15 19:36:18,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 505 states. [2021-10-15 19:36:18,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 505 to 489. [2021-10-15 19:36:18,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 489 states, 384 states have (on average 1.2395833333333333) internal successors, (476), 391 states have internal predecessors, (476), 60 states have call successors, (60), 42 states have call predecessors, (60), 44 states have return successors, (68), 56 states have call predecessors, (68), 54 states have call successors, (68) [2021-10-15 19:36:18,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 489 states to 489 states and 604 transitions. [2021-10-15 19:36:18,815 INFO L78 Accepts]: Start accepts. Automaton has 489 states and 604 transitions. Word has length 63 [2021-10-15 19:36:18,816 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-15 19:36:18,816 INFO L470 AbstractCegarLoop]: Abstraction has 489 states and 604 transitions. [2021-10-15 19:36:18,816 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 4.083333333333333) internal successors, (49), 6 states have internal predecessors, (49), 2 states have call successors, (8), 7 states have call predecessors, (8), 3 states have return successors, (6), 3 states have call predecessors, (6), 1 states have call successors, (6) [2021-10-15 19:36:18,816 INFO L276 IsEmpty]: Start isEmpty. Operand 489 states and 604 transitions. [2021-10-15 19:36:18,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2021-10-15 19:36:18,818 INFO L504 BasicCegarLoop]: Found error trace [2021-10-15 19:36:18,818 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-15 19:36:18,818 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2021-10-15 19:36:18,819 INFO L402 AbstractCegarLoop]: === Iteration 40 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2021-10-15 19:36:18,819 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-15 19:36:18,819 INFO L82 PathProgramCache]: Analyzing trace with hash -1336611306, now seen corresponding path program 1 times [2021-10-15 19:36:18,819 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-15 19:36:18,820 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1332093691] [2021-10-15 19:36:18,820 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-15 19:36:18,820 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-15 19:36:18,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-15 19:36:18,942 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-10-15 19:36:18,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-15 19:36:18,985 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-10-15 19:36:18,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-15 19:36:19,004 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-10-15 19:36:19,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-15 19:36:19,025 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-10-15 19:36:19,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-15 19:36:19,086 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-10-15 19:36:19,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-15 19:36:19,117 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-15 19:36:19,118 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-15 19:36:19,118 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1332093691] [2021-10-15 19:36:19,118 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1332093691] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-15 19:36:19,118 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-15 19:36:19,118 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2021-10-15 19:36:19,118 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [660609786] [2021-10-15 19:36:19,119 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2021-10-15 19:36:19,119 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-15 19:36:19,119 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-10-15 19:36:19,120 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=148, Unknown=0, NotChecked=0, Total=182 [2021-10-15 19:36:19,121 INFO L87 Difference]: Start difference. First operand 489 states and 604 transitions. Second operand has 14 states, 14 states have (on average 3.642857142857143) internal successors, (51), 7 states have internal predecessors, (51), 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-15 19:36:20,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-15 19:36:20,516 INFO L93 Difference]: Finished difference Result 519 states and 639 transitions. [2021-10-15 19:36:20,516 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-10-15 19:36:20,516 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 3.642857142857143) internal successors, (51), 7 states have internal predecessors, (51), 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 63 [2021-10-15 19:36:20,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-15 19:36:20,517 INFO L225 Difference]: With dead ends: 519 [2021-10-15 19:36:20,518 INFO L226 Difference]: Without dead ends: 501 [2021-10-15 19:36:20,518 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 226.6ms TimeCoverageRelationStatistics Valid=42, Invalid=198, Unknown=0, NotChecked=0, Total=240 [2021-10-15 19:36:20,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 501 states. [2021-10-15 19:36:20,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 501 to 485. [2021-10-15 19:36:20,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 485 states, 381 states have (on average 1.2388451443569555) internal successors, (472), 388 states have internal predecessors, (472), 59 states have call successors, (59), 42 states have call predecessors, (59), 44 states have return successors, (67), 55 states have call predecessors, (67), 53 states have call successors, (67) [2021-10-15 19:36:20,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 485 states to 485 states and 598 transitions. [2021-10-15 19:36:20,527 INFO L78 Accepts]: Start accepts. Automaton has 485 states and 598 transitions. Word has length 63 [2021-10-15 19:36:20,527 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-15 19:36:20,528 INFO L470 AbstractCegarLoop]: Abstraction has 485 states and 598 transitions. [2021-10-15 19:36:20,528 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 3.642857142857143) internal successors, (51), 7 states have internal predecessors, (51), 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-15 19:36:20,528 INFO L276 IsEmpty]: Start isEmpty. Operand 485 states and 598 transitions. [2021-10-15 19:36:20,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2021-10-15 19:36:20,530 INFO L504 BasicCegarLoop]: Found error trace [2021-10-15 19:36:20,530 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-15 19:36:20,530 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2021-10-15 19:36:20,531 INFO L402 AbstractCegarLoop]: === Iteration 41 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2021-10-15 19:36:20,531 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-15 19:36:20,531 INFO L82 PathProgramCache]: Analyzing trace with hash 2015464718, now seen corresponding path program 1 times [2021-10-15 19:36:20,531 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-15 19:36:20,531 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1409865008] [2021-10-15 19:36:20,532 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-15 19:36:20,532 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-15 19:36:20,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-15 19:36:20,676 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-10-15 19:36:20,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-15 19:36:20,712 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-10-15 19:36:20,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-15 19:36:20,730 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-10-15 19:36:20,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-15 19:36:20,743 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2021-10-15 19:36:20,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-15 19:36:20,796 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-10-15 19:36:20,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-15 19:36:20,800 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-10-15 19:36:20,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-15 19:36:20,812 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-10-15 19:36:20,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-15 19:36:20,815 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-15 19:36:20,816 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-15 19:36:20,816 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1409865008] [2021-10-15 19:36:20,816 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1409865008] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-15 19:36:20,816 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-15 19:36:20,817 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-10-15 19:36:20,817 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [676946791] [2021-10-15 19:36:20,817 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-10-15 19:36:20,817 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-15 19:36:20,818 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-10-15 19:36:20,818 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2021-10-15 19:36:20,818 INFO L87 Difference]: Start difference. First operand 485 states and 598 transitions. Second operand has 12 states, 12 states have (on average 4.416666666666667) internal successors, (53), 5 states have internal predecessors, (53), 2 states have call successors, (11), 8 states have call predecessors, (11), 2 states have return successors, (7), 2 states have call predecessors, (7), 1 states have call successors, (7) [2021-10-15 19:36:22,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-15 19:36:22,317 INFO L93 Difference]: Finished difference Result 520 states and 645 transitions. [2021-10-15 19:36:22,318 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-10-15 19:36:22,318 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 4.416666666666667) internal successors, (53), 5 states have internal predecessors, (53), 2 states have call successors, (11), 8 states have call predecessors, (11), 2 states have return successors, (7), 2 states have call predecessors, (7), 1 states have call successors, (7) Word has length 71 [2021-10-15 19:36:22,318 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-15 19:36:22,319 INFO L225 Difference]: With dead ends: 520 [2021-10-15 19:36:22,319 INFO L226 Difference]: Without dead ends: 520 [2021-10-15 19:36:22,320 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 314.1ms TimeCoverageRelationStatistics Valid=60, Invalid=180, Unknown=0, NotChecked=0, Total=240 [2021-10-15 19:36:22,321 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 520 states. [2021-10-15 19:36:22,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 520 to 485. [2021-10-15 19:36:22,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 485 states, 381 states have (on average 1.2335958005249343) internal successors, (470), 388 states have internal predecessors, (470), 59 states have call successors, (59), 42 states have call predecessors, (59), 44 states have return successors, (67), 55 states have call predecessors, (67), 53 states have call successors, (67) [2021-10-15 19:36:22,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 485 states to 485 states and 596 transitions. [2021-10-15 19:36:22,330 INFO L78 Accepts]: Start accepts. Automaton has 485 states and 596 transitions. Word has length 71 [2021-10-15 19:36:22,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-15 19:36:22,331 INFO L470 AbstractCegarLoop]: Abstraction has 485 states and 596 transitions. [2021-10-15 19:36:22,331 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 4.416666666666667) internal successors, (53), 5 states have internal predecessors, (53), 2 states have call successors, (11), 8 states have call predecessors, (11), 2 states have return successors, (7), 2 states have call predecessors, (7), 1 states have call successors, (7) [2021-10-15 19:36:22,331 INFO L276 IsEmpty]: Start isEmpty. Operand 485 states and 596 transitions. [2021-10-15 19:36:22,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2021-10-15 19:36:22,333 INFO L504 BasicCegarLoop]: Found error trace [2021-10-15 19:36:22,333 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] [2021-10-15 19:36:22,333 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2021-10-15 19:36:22,334 INFO L402 AbstractCegarLoop]: === Iteration 42 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2021-10-15 19:36:22,334 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-15 19:36:22,334 INFO L82 PathProgramCache]: Analyzing trace with hash -137076744, now seen corresponding path program 1 times [2021-10-15 19:36:22,334 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-15 19:36:22,335 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [777248485] [2021-10-15 19:36:22,335 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-15 19:36:22,335 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-15 19:36:22,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-15 19:36:22,469 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-10-15 19:36:22,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-15 19:36:22,501 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-10-15 19:36:22,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-15 19:36:22,519 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-10-15 19:36:22,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-15 19:36:22,536 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-10-15 19:36:22,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-15 19:36:22,623 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-10-15 19:36:22,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-15 19:36:22,658 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-15 19:36:22,659 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-15 19:36:22,659 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [777248485] [2021-10-15 19:36:22,659 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [777248485] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-15 19:36:22,659 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-15 19:36:22,659 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2021-10-15 19:36:22,660 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2091500402] [2021-10-15 19:36:22,661 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-10-15 19:36:22,661 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-15 19:36:22,661 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-10-15 19:36:22,662 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2021-10-15 19:36:22,662 INFO L87 Difference]: Start difference. First operand 485 states and 596 transitions. Second operand has 13 states, 13 states have (on average 4.0) internal successors, (52), 6 states have internal predecessors, (52), 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-15 19:36:24,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-15 19:36:24,013 INFO L93 Difference]: Finished difference Result 509 states and 624 transitions. [2021-10-15 19:36:24,014 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-10-15 19:36:24,014 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 4.0) internal successors, (52), 6 states have internal predecessors, (52), 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 64 [2021-10-15 19:36:24,014 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-15 19:36:24,015 INFO L225 Difference]: With dead ends: 509 [2021-10-15 19:36:24,016 INFO L226 Difference]: Without dead ends: 490 [2021-10-15 19:36:24,016 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 215.0ms TimeCoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2021-10-15 19:36:24,017 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 490 states. [2021-10-15 19:36:24,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 490 to 474. [2021-10-15 19:36:24,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 474 states, 372 states have (on average 1.2311827956989247) internal successors, (458), 379 states have internal predecessors, (458), 58 states have call successors, (58), 42 states have call predecessors, (58), 43 states have return successors, (65), 53 states have call predecessors, (65), 52 states have call successors, (65) [2021-10-15 19:36:24,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 474 states to 474 states and 581 transitions. [2021-10-15 19:36:24,025 INFO L78 Accepts]: Start accepts. Automaton has 474 states and 581 transitions. Word has length 64 [2021-10-15 19:36:24,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-15 19:36:24,026 INFO L470 AbstractCegarLoop]: Abstraction has 474 states and 581 transitions. [2021-10-15 19:36:24,026 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 4.0) internal successors, (52), 6 states have internal predecessors, (52), 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-15 19:36:24,026 INFO L276 IsEmpty]: Start isEmpty. Operand 474 states and 581 transitions. [2021-10-15 19:36:24,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2021-10-15 19:36:24,028 INFO L504 BasicCegarLoop]: Found error trace [2021-10-15 19:36:24,029 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] [2021-10-15 19:36:24,029 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2021-10-15 19:36:24,029 INFO L402 AbstractCegarLoop]: === Iteration 43 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2021-10-15 19:36:24,029 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-15 19:36:24,030 INFO L82 PathProgramCache]: Analyzing trace with hash 130187692, now seen corresponding path program 1 times [2021-10-15 19:36:24,030 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-15 19:36:24,030 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1019435708] [2021-10-15 19:36:24,030 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-15 19:36:24,031 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-15 19:36:24,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-15 19:36:24,164 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-10-15 19:36:24,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-15 19:36:24,203 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-10-15 19:36:24,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-15 19:36:24,226 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-10-15 19:36:24,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-15 19:36:24,253 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-10-15 19:36:24,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-15 19:36:24,320 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-10-15 19:36:24,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-15 19:36:24,358 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-15 19:36:24,358 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-15 19:36:24,360 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1019435708] [2021-10-15 19:36:24,361 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1019435708] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-15 19:36:24,361 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-15 19:36:24,361 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2021-10-15 19:36:24,361 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1347178972] [2021-10-15 19:36:24,362 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2021-10-15 19:36:24,362 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-15 19:36:24,363 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-10-15 19:36:24,364 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=148, Unknown=0, NotChecked=0, Total=182 [2021-10-15 19:36:24,364 INFO L87 Difference]: Start difference. First operand 474 states and 581 transitions. Second operand has 14 states, 14 states have (on average 3.7142857142857144) internal successors, (52), 7 states have internal predecessors, (52), 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-15 19:36:25,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-15 19:36:25,586 INFO L93 Difference]: Finished difference Result 504 states and 616 transitions. [2021-10-15 19:36:25,586 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-10-15 19:36:25,586 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 3.7142857142857144) internal successors, (52), 7 states have internal predecessors, (52), 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 64 [2021-10-15 19:36:25,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-15 19:36:25,588 INFO L225 Difference]: With dead ends: 504 [2021-10-15 19:36:25,588 INFO L226 Difference]: Without dead ends: 485 [2021-10-15 19:36:25,588 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 253.0ms TimeCoverageRelationStatistics Valid=42, Invalid=198, Unknown=0, NotChecked=0, Total=240 [2021-10-15 19:36:25,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 485 states. [2021-10-15 19:36:25,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 485 to 469. [2021-10-15 19:36:25,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 469 states, 368 states have (on average 1.2309782608695652) internal successors, (453), 375 states have internal predecessors, (453), 57 states have call successors, (57), 42 states have call predecessors, (57), 43 states have return successors, (64), 52 states have call predecessors, (64), 51 states have call successors, (64) [2021-10-15 19:36:25,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 469 states to 469 states and 574 transitions. [2021-10-15 19:36:25,597 INFO L78 Accepts]: Start accepts. Automaton has 469 states and 574 transitions. Word has length 64 [2021-10-15 19:36:25,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-15 19:36:25,597 INFO L470 AbstractCegarLoop]: Abstraction has 469 states and 574 transitions. [2021-10-15 19:36:25,597 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 3.7142857142857144) internal successors, (52), 7 states have internal predecessors, (52), 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-15 19:36:25,598 INFO L276 IsEmpty]: Start isEmpty. Operand 469 states and 574 transitions. [2021-10-15 19:36:25,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2021-10-15 19:36:25,599 INFO L504 BasicCegarLoop]: Found error trace [2021-10-15 19:36:25,600 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] [2021-10-15 19:36:25,600 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2021-10-15 19:36:25,600 INFO L402 AbstractCegarLoop]: === Iteration 44 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2021-10-15 19:36:25,601 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-15 19:36:25,601 INFO L82 PathProgramCache]: Analyzing trace with hash -799923778, now seen corresponding path program 1 times [2021-10-15 19:36:25,601 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-15 19:36:25,601 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1339050994] [2021-10-15 19:36:25,602 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-15 19:36:25,602 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-15 19:36:25,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-15 19:36:25,734 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-10-15 19:36:25,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-15 19:36:25,771 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-10-15 19:36:25,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-15 19:36:25,793 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-10-15 19:36:25,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-15 19:36:25,818 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-10-15 19:36:25,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-15 19:36:25,884 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-10-15 19:36:25,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-15 19:36:25,917 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-15 19:36:25,918 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-15 19:36:25,918 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1339050994] [2021-10-15 19:36:25,926 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1339050994] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-15 19:36:25,926 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-15 19:36:25,926 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2021-10-15 19:36:25,927 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2114206100] [2021-10-15 19:36:25,928 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2021-10-15 19:36:25,928 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-15 19:36:25,928 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-10-15 19:36:25,929 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=148, Unknown=0, NotChecked=0, Total=182 [2021-10-15 19:36:25,929 INFO L87 Difference]: Start difference. First operand 469 states and 574 transitions. Second operand has 14 states, 14 states have (on average 3.7142857142857144) internal successors, (52), 7 states have internal predecessors, (52), 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-15 19:36:27,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-15 19:36:27,373 INFO L93 Difference]: Finished difference Result 499 states and 609 transitions. [2021-10-15 19:36:27,374 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-10-15 19:36:27,374 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 3.7142857142857144) internal successors, (52), 7 states have internal predecessors, (52), 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 64 [2021-10-15 19:36:27,374 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-15 19:36:27,376 INFO L225 Difference]: With dead ends: 499 [2021-10-15 19:36:27,376 INFO L226 Difference]: Without dead ends: 481 [2021-10-15 19:36:27,376 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 245.4ms TimeCoverageRelationStatistics Valid=42, Invalid=198, Unknown=0, NotChecked=0, Total=240 [2021-10-15 19:36:27,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 481 states. [2021-10-15 19:36:27,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 481 to 465. [2021-10-15 19:36:27,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 465 states, 365 states have (on average 1.2301369863013698) internal successors, (449), 372 states have internal predecessors, (449), 56 states have call successors, (56), 42 states have call predecessors, (56), 43 states have return successors, (63), 51 states have call predecessors, (63), 50 states have call successors, (63) [2021-10-15 19:36:27,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 465 states to 465 states and 568 transitions. [2021-10-15 19:36:27,386 INFO L78 Accepts]: Start accepts. Automaton has 465 states and 568 transitions. Word has length 64 [2021-10-15 19:36:27,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-15 19:36:27,386 INFO L470 AbstractCegarLoop]: Abstraction has 465 states and 568 transitions. [2021-10-15 19:36:27,386 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 3.7142857142857144) internal successors, (52), 7 states have internal predecessors, (52), 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-15 19:36:27,387 INFO L276 IsEmpty]: Start isEmpty. Operand 465 states and 568 transitions. [2021-10-15 19:36:27,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2021-10-15 19:36:27,388 INFO L504 BasicCegarLoop]: Found error trace [2021-10-15 19:36:27,389 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] [2021-10-15 19:36:27,389 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2021-10-15 19:36:27,389 INFO L402 AbstractCegarLoop]: === Iteration 45 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2021-10-15 19:36:27,390 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-15 19:36:27,390 INFO L82 PathProgramCache]: Analyzing trace with hash -163798071, now seen corresponding path program 1 times [2021-10-15 19:36:27,390 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-15 19:36:27,390 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [96015450] [2021-10-15 19:36:27,391 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-15 19:36:27,391 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-15 19:36:27,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-15 19:36:27,520 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-10-15 19:36:27,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-15 19:36:27,561 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-10-15 19:36:27,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-15 19:36:27,580 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-10-15 19:36:27,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-15 19:36:27,595 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2021-10-15 19:36:27,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-15 19:36:27,612 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-10-15 19:36:27,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-15 19:36:27,618 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-10-15 19:36:27,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-15 19:36:27,631 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-10-15 19:36:27,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-15 19:36:27,635 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-15 19:36:27,635 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-15 19:36:27,635 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [96015450] [2021-10-15 19:36:27,635 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [96015450] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-15 19:36:27,635 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-15 19:36:27,636 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-10-15 19:36:27,636 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2088778770] [2021-10-15 19:36:27,636 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-10-15 19:36:27,636 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-15 19:36:27,637 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-10-15 19:36:27,637 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2021-10-15 19:36:27,637 INFO L87 Difference]: Start difference. First operand 465 states and 568 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, (12), 9 states have call predecessors, (12), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2021-10-15 19:36:28,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-15 19:36:28,880 INFO L93 Difference]: Finished difference Result 625 states and 761 transitions. [2021-10-15 19:36:28,880 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-10-15 19:36:28,880 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, (12), 9 states have call predecessors, (12), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 70 [2021-10-15 19:36:28,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-15 19:36:28,882 INFO L225 Difference]: With dead ends: 625 [2021-10-15 19:36:28,882 INFO L226 Difference]: Without dead ends: 625 [2021-10-15 19:36:28,883 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 275.1ms TimeCoverageRelationStatistics Valid=57, Invalid=99, Unknown=0, NotChecked=0, Total=156 [2021-10-15 19:36:28,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 625 states. [2021-10-15 19:36:28,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 625 to 586. [2021-10-15 19:36:28,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 586 states, 458 states have (on average 1.220524017467249) internal successors, (559), 467 states have internal predecessors, (559), 69 states have call successors, (69), 52 states have call predecessors, (69), 58 states have return successors, (88), 67 states have call predecessors, (88), 64 states have call successors, (88) [2021-10-15 19:36:28,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 586 states to 586 states and 716 transitions. [2021-10-15 19:36:28,894 INFO L78 Accepts]: Start accepts. Automaton has 586 states and 716 transitions. Word has length 70 [2021-10-15 19:36:28,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-15 19:36:28,895 INFO L470 AbstractCegarLoop]: Abstraction has 586 states and 716 transitions. [2021-10-15 19:36:28,895 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, (12), 9 states have call predecessors, (12), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2021-10-15 19:36:28,895 INFO L276 IsEmpty]: Start isEmpty. Operand 586 states and 716 transitions. [2021-10-15 19:36:28,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2021-10-15 19:36:28,897 INFO L504 BasicCegarLoop]: Found error trace [2021-10-15 19:36:28,897 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-15 19:36:28,898 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2021-10-15 19:36:28,898 INFO L402 AbstractCegarLoop]: === Iteration 46 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2021-10-15 19:36:28,898 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-15 19:36:28,898 INFO L82 PathProgramCache]: Analyzing trace with hash 1554229741, now seen corresponding path program 1 times [2021-10-15 19:36:28,899 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-15 19:36:28,899 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1256100964] [2021-10-15 19:36:28,899 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-15 19:36:28,899 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-15 19:36:28,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-15 19:36:29,024 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-10-15 19:36:29,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-15 19:36:29,052 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-10-15 19:36:29,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-15 19:36:29,067 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-10-15 19:36:29,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-15 19:36:29,085 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-10-15 19:36:29,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-15 19:36:29,132 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2021-10-15 19:36:29,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-15 19:36:29,158 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-15 19:36:29,159 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-15 19:36:29,159 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1256100964] [2021-10-15 19:36:29,159 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1256100964] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-15 19:36:29,159 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-15 19:36:29,159 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2021-10-15 19:36:29,160 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [549248378] [2021-10-15 19:36:29,160 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2021-10-15 19:36:29,160 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-15 19:36:29,161 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-10-15 19:36:29,161 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=148, Unknown=0, NotChecked=0, Total=182 [2021-10-15 19:36:29,161 INFO L87 Difference]: Start difference. First operand 586 states and 716 transitions. Second operand has 14 states, 14 states have (on average 4.0) internal successors, (56), 7 states have internal predecessors, (56), 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-15 19:36:30,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-15 19:36:30,516 INFO L93 Difference]: Finished difference Result 616 states and 752 transitions. [2021-10-15 19:36:30,516 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-10-15 19:36:30,516 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 4.0) internal successors, (56), 7 states have internal predecessors, (56), 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 68 [2021-10-15 19:36:30,517 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-15 19:36:30,518 INFO L225 Difference]: With dead ends: 616 [2021-10-15 19:36:30,518 INFO L226 Difference]: Without dead ends: 576 [2021-10-15 19:36:30,518 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 200.4ms TimeCoverageRelationStatistics Valid=42, Invalid=198, Unknown=0, NotChecked=0, Total=240 [2021-10-15 19:36:30,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 576 states. [2021-10-15 19:36:30,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 576 to 560. [2021-10-15 19:36:30,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 560 states, 437 states have (on average 1.2196796338672768) internal successors, (533), 446 states have internal predecessors, (533), 66 states have call successors, (66), 50 states have call predecessors, (66), 56 states have return successors, (85), 64 states have call predecessors, (85), 61 states have call successors, (85) [2021-10-15 19:36:30,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 560 states to 560 states and 684 transitions. [2021-10-15 19:36:30,527 INFO L78 Accepts]: Start accepts. Automaton has 560 states and 684 transitions. Word has length 68 [2021-10-15 19:36:30,527 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-15 19:36:30,527 INFO L470 AbstractCegarLoop]: Abstraction has 560 states and 684 transitions. [2021-10-15 19:36:30,528 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 4.0) internal successors, (56), 7 states have internal predecessors, (56), 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-15 19:36:30,528 INFO L276 IsEmpty]: Start isEmpty. Operand 560 states and 684 transitions. [2021-10-15 19:36:30,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2021-10-15 19:36:30,529 INFO L504 BasicCegarLoop]: Found error trace [2021-10-15 19:36:30,529 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-15 19:36:30,529 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45 [2021-10-15 19:36:30,530 INFO L402 AbstractCegarLoop]: === Iteration 47 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2021-10-15 19:36:30,530 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-15 19:36:30,530 INFO L82 PathProgramCache]: Analyzing trace with hash -635159596, now seen corresponding path program 1 times [2021-10-15 19:36:30,530 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-15 19:36:30,530 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2120907697] [2021-10-15 19:36:30,530 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-15 19:36:30,531 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-15 19:36:30,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-15 19:36:30,654 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-10-15 19:36:30,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-15 19:36:30,686 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-10-15 19:36:30,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-15 19:36:30,704 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-10-15 19:36:30,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-15 19:36:30,724 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-10-15 19:36:30,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-15 19:36:30,781 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2021-10-15 19:36:30,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-15 19:36:30,807 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-10-15 19:36:30,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-15 19:36:30,832 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2021-10-15 19:36:30,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-15 19:36:30,835 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-15 19:36:30,836 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-15 19:36:30,836 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2120907697] [2021-10-15 19:36:30,836 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2120907697] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-15 19:36:30,836 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-15 19:36:30,836 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2021-10-15 19:36:30,836 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [522675938] [2021-10-15 19:36:30,836 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2021-10-15 19:36:30,837 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-15 19:36:30,837 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-10-15 19:36:30,837 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=173, Unknown=0, NotChecked=0, Total=210 [2021-10-15 19:36:30,837 INFO L87 Difference]: Start difference. First operand 560 states and 684 transitions. Second operand has 15 states, 15 states have (on average 3.6666666666666665) internal successors, (55), 7 states have internal predecessors, (55), 3 states have call successors, (9), 8 states have call predecessors, (9), 3 states have return successors, (7), 4 states have call predecessors, (7), 2 states have call successors, (7) [2021-10-15 19:36:32,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-15 19:36:32,365 INFO L93 Difference]: Finished difference Result 586 states and 715 transitions. [2021-10-15 19:36:32,366 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-10-15 19:36:32,366 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 3.6666666666666665) internal successors, (55), 7 states have internal predecessors, (55), 3 states have call successors, (9), 8 states have call predecessors, (9), 3 states have return successors, (7), 4 states have call predecessors, (7), 2 states have call successors, (7) Word has length 71 [2021-10-15 19:36:32,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-15 19:36:32,372 INFO L225 Difference]: With dead ends: 586 [2021-10-15 19:36:32,372 INFO L226 Difference]: Without dead ends: 535 [2021-10-15 19:36:32,373 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 325.8ms TimeCoverageRelationStatistics Valid=73, Invalid=347, Unknown=0, NotChecked=0, Total=420 [2021-10-15 19:36:32,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 535 states. [2021-10-15 19:36:32,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 535 to 519. [2021-10-15 19:36:32,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 519 states, 403 states have (on average 1.2133995037220844) internal successors, (489), 412 states have internal predecessors, (489), 62 states have call successors, (62), 47 states have call predecessors, (62), 53 states have return successors, (81), 60 states have call predecessors, (81), 57 states have call successors, (81) [2021-10-15 19:36:32,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 519 states to 519 states and 632 transitions. [2021-10-15 19:36:32,386 INFO L78 Accepts]: Start accepts. Automaton has 519 states and 632 transitions. Word has length 71 [2021-10-15 19:36:32,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-15 19:36:32,386 INFO L470 AbstractCegarLoop]: Abstraction has 519 states and 632 transitions. [2021-10-15 19:36:32,386 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 3.6666666666666665) internal successors, (55), 7 states have internal predecessors, (55), 3 states have call successors, (9), 8 states have call predecessors, (9), 3 states have return successors, (7), 4 states have call predecessors, (7), 2 states have call successors, (7) [2021-10-15 19:36:32,387 INFO L276 IsEmpty]: Start isEmpty. Operand 519 states and 632 transitions. [2021-10-15 19:36:32,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2021-10-15 19:36:32,389 INFO L504 BasicCegarLoop]: Found error trace [2021-10-15 19:36:32,389 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] [2021-10-15 19:36:32,389 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46 [2021-10-15 19:36:32,390 INFO L402 AbstractCegarLoop]: === Iteration 48 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2021-10-15 19:36:32,390 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-15 19:36:32,390 INFO L82 PathProgramCache]: Analyzing trace with hash 1523992416, now seen corresponding path program 1 times [2021-10-15 19:36:32,391 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-15 19:36:32,391 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [55001240] [2021-10-15 19:36:32,391 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-15 19:36:32,391 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-15 19:36:32,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-15 19:36:32,622 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-10-15 19:36:32,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-15 19:36:32,659 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-10-15 19:36:32,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-15 19:36:32,683 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-10-15 19:36:32,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-15 19:36:32,701 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2021-10-15 19:36:32,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-15 19:36:32,721 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-10-15 19:36:32,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-15 19:36:32,726 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-10-15 19:36:32,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-15 19:36:32,739 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-10-15 19:36:32,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-15 19:36:32,755 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2021-10-15 19:36:32,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-15 19:36:32,777 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-15 19:36:32,778 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-15 19:36:32,778 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [55001240] [2021-10-15 19:36:32,778 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [55001240] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-15 19:36:32,779 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-15 19:36:32,779 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-10-15 19:36:32,779 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [102819593] [2021-10-15 19:36:32,779 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-10-15 19:36:32,780 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-15 19:36:32,780 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-10-15 19:36:32,780 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2021-10-15 19:36:32,781 INFO L87 Difference]: Start difference. First operand 519 states and 632 transitions. Second operand has 12 states, 12 states have (on average 5.166666666666667) internal successors, (62), 6 states have internal predecessors, (62), 4 states have call successors, (12), 10 states have call predecessors, (12), 4 states have return successors, (8), 4 states have call predecessors, (8), 3 states have call successors, (8) [2021-10-15 19:36:34,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-15 19:36:34,488 INFO L93 Difference]: Finished difference Result 523 states and 631 transitions. [2021-10-15 19:36:34,488 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2021-10-15 19:36:34,488 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 5.166666666666667) internal successors, (62), 6 states have internal predecessors, (62), 4 states have call successors, (12), 10 states have call predecessors, (12), 4 states have return successors, (8), 4 states have call predecessors, (8), 3 states have call successors, (8) Word has length 82 [2021-10-15 19:36:34,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-15 19:36:34,490 INFO L225 Difference]: With dead ends: 523 [2021-10-15 19:36:34,490 INFO L226 Difference]: Without dead ends: 523 [2021-10-15 19:36:34,492 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 93 ImplicationChecksByTransitivity, 726.3ms TimeCoverageRelationStatistics Valid=189, Invalid=461, Unknown=0, NotChecked=0, Total=650 [2021-10-15 19:36:34,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 523 states. [2021-10-15 19:36:34,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 523 to 501. [2021-10-15 19:36:34,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 501 states, 389 states have (on average 1.2133676092544987) internal successors, (472), 397 states have internal predecessors, (472), 60 states have call successors, (60), 47 states have call predecessors, (60), 51 states have return successors, (70), 57 states have call predecessors, (70), 55 states have call successors, (70) [2021-10-15 19:36:34,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 501 states to 501 states and 602 transitions. [2021-10-15 19:36:34,503 INFO L78 Accepts]: Start accepts. Automaton has 501 states and 602 transitions. Word has length 82 [2021-10-15 19:36:34,503 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-15 19:36:34,504 INFO L470 AbstractCegarLoop]: Abstraction has 501 states and 602 transitions. [2021-10-15 19:36:34,511 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 5.166666666666667) internal successors, (62), 6 states have internal predecessors, (62), 4 states have call successors, (12), 10 states have call predecessors, (12), 4 states have return successors, (8), 4 states have call predecessors, (8), 3 states have call successors, (8) [2021-10-15 19:36:34,511 INFO L276 IsEmpty]: Start isEmpty. Operand 501 states and 602 transitions. [2021-10-15 19:36:34,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2021-10-15 19:36:34,513 INFO L504 BasicCegarLoop]: Found error trace [2021-10-15 19:36:34,513 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-15 19:36:34,514 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47 [2021-10-15 19:36:34,517 INFO L402 AbstractCegarLoop]: === Iteration 49 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2021-10-15 19:36:34,517 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-15 19:36:34,518 INFO L82 PathProgramCache]: Analyzing trace with hash 100987323, now seen corresponding path program 1 times [2021-10-15 19:36:34,518 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-15 19:36:34,518 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [164377047] [2021-10-15 19:36:34,519 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-15 19:36:34,519 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-15 19:36:34,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-15 19:36:34,666 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-10-15 19:36:34,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-15 19:36:34,709 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-10-15 19:36:34,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-15 19:36:34,727 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-10-15 19:36:34,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-15 19:36:34,740 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2021-10-15 19:36:34,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-15 19:36:34,806 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-10-15 19:36:34,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-15 19:36:34,809 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-10-15 19:36:34,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-15 19:36:34,821 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-10-15 19:36:34,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-15 19:36:34,842 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2021-10-15 19:36:34,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-15 19:36:34,862 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-10-15 19:36:34,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-15 19:36:34,866 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-15 19:36:34,867 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-15 19:36:34,867 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [164377047] [2021-10-15 19:36:34,867 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [164377047] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-15 19:36:34,867 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-15 19:36:34,867 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2021-10-15 19:36:34,868 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [991031344] [2021-10-15 19:36:34,868 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2021-10-15 19:36:34,868 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-15 19:36:34,869 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-10-15 19:36:34,869 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=133, Unknown=0, NotChecked=0, Total=182 [2021-10-15 19:36:34,870 INFO L87 Difference]: Start difference. First operand 501 states and 602 transitions. Second operand has 14 states, 14 states have (on average 4.285714285714286) internal successors, (60), 5 states have internal predecessors, (60), 2 states have call successors, (14), 10 states have call predecessors, (14), 2 states have return successors, (9), 3 states have call predecessors, (9), 2 states have call successors, (9) [2021-10-15 19:36:35,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-15 19:36:35,887 INFO L93 Difference]: Finished difference Result 585 states and 740 transitions. [2021-10-15 19:36:35,888 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2021-10-15 19:36:35,888 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 4.285714285714286) internal successors, (60), 5 states have internal predecessors, (60), 2 states have call successors, (14), 10 states have call predecessors, (14), 2 states have return successors, (9), 3 states have call predecessors, (9), 2 states have call successors, (9) Word has length 83 [2021-10-15 19:36:35,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-15 19:36:35,890 INFO L225 Difference]: With dead ends: 585 [2021-10-15 19:36:35,891 INFO L226 Difference]: Without dead ends: 585 [2021-10-15 19:36:35,891 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 371.3ms TimeCoverageRelationStatistics Valid=115, Invalid=391, Unknown=0, NotChecked=0, Total=506 [2021-10-15 19:36:35,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 585 states. [2021-10-15 19:36:35,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 585 to 465. [2021-10-15 19:36:35,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 465 states, 365 states have (on average 1.2136986301369863) internal successors, (443), 371 states have internal predecessors, (443), 53 states have call successors, (53), 41 states have call predecessors, (53), 46 states have return successors, (60), 53 states have call predecessors, (60), 49 states have call successors, (60) [2021-10-15 19:36:35,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 465 states to 465 states and 556 transitions. [2021-10-15 19:36:35,903 INFO L78 Accepts]: Start accepts. Automaton has 465 states and 556 transitions. Word has length 83 [2021-10-15 19:36:35,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-15 19:36:35,904 INFO L470 AbstractCegarLoop]: Abstraction has 465 states and 556 transitions. [2021-10-15 19:36:35,904 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 4.285714285714286) internal successors, (60), 5 states have internal predecessors, (60), 2 states have call successors, (14), 10 states have call predecessors, (14), 2 states have return successors, (9), 3 states have call predecessors, (9), 2 states have call successors, (9) [2021-10-15 19:36:35,904 INFO L276 IsEmpty]: Start isEmpty. Operand 465 states and 556 transitions. [2021-10-15 19:36:35,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2021-10-15 19:36:35,906 INFO L504 BasicCegarLoop]: Found error trace [2021-10-15 19:36:35,906 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] [2021-10-15 19:36:35,907 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable48 [2021-10-15 19:36:35,907 INFO L402 AbstractCegarLoop]: === Iteration 50 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2021-10-15 19:36:35,907 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-15 19:36:35,908 INFO L82 PathProgramCache]: Analyzing trace with hash 501668298, now seen corresponding path program 1 times [2021-10-15 19:36:35,908 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-15 19:36:35,908 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2140888386] [2021-10-15 19:36:35,908 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-15 19:36:35,909 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-15 19:36:35,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-15 19:36:36,055 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-10-15 19:36:36,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-15 19:36:36,099 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-10-15 19:36:36,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-15 19:36:36,122 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-10-15 19:36:36,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-15 19:36:36,148 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-10-15 19:36:36,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-15 19:36:36,228 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-10-15 19:36:36,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-15 19:36:36,309 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-10-15 19:36:36,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-15 19:36:36,313 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-10-15 19:36:36,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-15 19:36:36,331 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-10-15 19:36:36,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-15 19:36:36,334 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2021-10-15 19:36:36,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-15 19:36:36,339 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-15 19:36:36,339 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-15 19:36:36,339 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2140888386] [2021-10-15 19:36:36,340 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2140888386] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-15 19:36:36,340 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-15 19:36:36,340 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2021-10-15 19:36:36,340 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [686426723] [2021-10-15 19:36:36,342 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2021-10-15 19:36:36,342 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-15 19:36:36,343 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-10-15 19:36:36,343 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=192, Unknown=0, NotChecked=0, Total=240 [2021-10-15 19:36:36,343 INFO L87 Difference]: Start difference. First operand 465 states and 556 transitions. Second operand has 16 states, 16 states have (on average 4.25) internal successors, (68), 7 states have internal predecessors, (68), 3 states have call successors, (11), 9 states have call predecessors, (11), 3 states have return successors, (9), 4 states have call predecessors, (9), 2 states have call successors, (9) [2021-10-15 19:36:37,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-15 19:36:37,872 INFO L93 Difference]: Finished difference Result 523 states and 626 transitions. [2021-10-15 19:36:37,872 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2021-10-15 19:36:37,873 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 4.25) internal successors, (68), 7 states have internal predecessors, (68), 3 states have call successors, (11), 9 states have call predecessors, (11), 3 states have return successors, (9), 4 states have call predecessors, (9), 2 states have call successors, (9) Word has length 88 [2021-10-15 19:36:37,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-15 19:36:37,874 INFO L225 Difference]: With dead ends: 523 [2021-10-15 19:36:37,874 INFO L226 Difference]: Without dead ends: 505 [2021-10-15 19:36:37,875 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 504.4ms TimeCoverageRelationStatistics Valid=101, Invalid=499, Unknown=0, NotChecked=0, Total=600 [2021-10-15 19:36:37,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 505 states. [2021-10-15 19:36:37,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 505 to 473. [2021-10-15 19:36:37,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 473 states, 372 states have (on average 1.2096774193548387) internal successors, (450), 378 states have internal predecessors, (450), 53 states have call successors, (53), 41 states have call predecessors, (53), 47 states have return successors, (63), 54 states have call predecessors, (63), 49 states have call successors, (63) [2021-10-15 19:36:37,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 473 states to 473 states and 566 transitions. [2021-10-15 19:36:37,887 INFO L78 Accepts]: Start accepts. Automaton has 473 states and 566 transitions. Word has length 88 [2021-10-15 19:36:37,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-15 19:36:37,887 INFO L470 AbstractCegarLoop]: Abstraction has 473 states and 566 transitions. [2021-10-15 19:36:37,888 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 4.25) internal successors, (68), 7 states have internal predecessors, (68), 3 states have call successors, (11), 9 states have call predecessors, (11), 3 states have return successors, (9), 4 states have call predecessors, (9), 2 states have call successors, (9) [2021-10-15 19:36:37,888 INFO L276 IsEmpty]: Start isEmpty. Operand 473 states and 566 transitions. [2021-10-15 19:36:37,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2021-10-15 19:36:37,890 INFO L504 BasicCegarLoop]: Found error trace [2021-10-15 19:36:37,890 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] [2021-10-15 19:36:37,891 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable49 [2021-10-15 19:36:37,891 INFO L402 AbstractCegarLoop]: === Iteration 51 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2021-10-15 19:36:37,891 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-15 19:36:37,892 INFO L82 PathProgramCache]: Analyzing trace with hash -1591352246, now seen corresponding path program 1 times [2021-10-15 19:36:37,892 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-15 19:36:37,892 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [656027825] [2021-10-15 19:36:37,892 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-15 19:36:37,893 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-15 19:36:37,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-15 19:36:38,044 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-10-15 19:36:38,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-15 19:36:38,078 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-10-15 19:36:38,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-15 19:36:38,095 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-10-15 19:36:38,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-15 19:36:38,117 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-10-15 19:36:38,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-15 19:36:38,187 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-10-15 19:36:38,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-15 19:36:38,253 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-10-15 19:36:38,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-15 19:36:38,258 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-10-15 19:36:38,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-15 19:36:38,278 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-10-15 19:36:38,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-15 19:36:38,281 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2021-10-15 19:36:38,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-15 19:36:38,286 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-15 19:36:38,286 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-15 19:36:38,286 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [656027825] [2021-10-15 19:36:38,287 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [656027825] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-15 19:36:38,287 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-15 19:36:38,287 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2021-10-15 19:36:38,287 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [897228468] [2021-10-15 19:36:38,288 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2021-10-15 19:36:38,288 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-15 19:36:38,289 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-10-15 19:36:38,289 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=192, Unknown=0, NotChecked=0, Total=240 [2021-10-15 19:36:38,289 INFO L87 Difference]: Start difference. First operand 473 states and 566 transitions. Second operand has 16 states, 16 states have (on average 4.3125) internal successors, (69), 7 states have internal predecessors, (69), 3 states have call successors, (11), 9 states have call predecessors, (11), 3 states have return successors, (9), 4 states have call predecessors, (9), 2 states have call successors, (9) [2021-10-15 19:36:39,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-15 19:36:39,583 INFO L93 Difference]: Finished difference Result 523 states and 625 transitions. [2021-10-15 19:36:39,584 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-10-15 19:36:39,584 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 4.3125) internal successors, (69), 7 states have internal predecessors, (69), 3 states have call successors, (11), 9 states have call predecessors, (11), 3 states have return successors, (9), 4 states have call predecessors, (9), 2 states have call successors, (9) Word has length 89 [2021-10-15 19:36:39,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-15 19:36:39,586 INFO L225 Difference]: With dead ends: 523 [2021-10-15 19:36:39,586 INFO L226 Difference]: Without dead ends: 505 [2021-10-15 19:36:39,586 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 382.2ms TimeCoverageRelationStatistics Valid=78, Invalid=342, Unknown=0, NotChecked=0, Total=420 [2021-10-15 19:36:39,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 505 states. [2021-10-15 19:36:39,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 505 to 465. [2021-10-15 19:36:39,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 465 states, 365 states have (on average 1.210958904109589) internal successors, (442), 371 states have internal predecessors, (442), 53 states have call successors, (53), 41 states have call predecessors, (53), 46 states have return successors, (60), 53 states have call predecessors, (60), 49 states have call successors, (60) [2021-10-15 19:36:39,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 465 states to 465 states and 555 transitions. [2021-10-15 19:36:39,593 INFO L78 Accepts]: Start accepts. Automaton has 465 states and 555 transitions. Word has length 89 [2021-10-15 19:36:39,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-15 19:36:39,594 INFO L470 AbstractCegarLoop]: Abstraction has 465 states and 555 transitions. [2021-10-15 19:36:39,594 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 4.3125) internal successors, (69), 7 states have internal predecessors, (69), 3 states have call successors, (11), 9 states have call predecessors, (11), 3 states have return successors, (9), 4 states have call predecessors, (9), 2 states have call successors, (9) [2021-10-15 19:36:39,594 INFO L276 IsEmpty]: Start isEmpty. Operand 465 states and 555 transitions. [2021-10-15 19:36:39,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2021-10-15 19:36:39,596 INFO L504 BasicCegarLoop]: Found error trace [2021-10-15 19:36:39,596 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-15 19:36:39,597 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50 [2021-10-15 19:36:39,597 INFO L402 AbstractCegarLoop]: === Iteration 52 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2021-10-15 19:36:39,597 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-15 19:36:39,598 INFO L82 PathProgramCache]: Analyzing trace with hash 590529597, now seen corresponding path program 1 times [2021-10-15 19:36:39,598 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-15 19:36:39,598 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1661009880] [2021-10-15 19:36:39,598 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-15 19:36:39,598 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-15 19:36:39,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-15 19:36:39,759 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-10-15 19:36:39,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-15 19:36:39,799 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-10-15 19:36:39,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-15 19:36:39,817 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-10-15 19:36:39,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-15 19:36:39,839 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-10-15 19:36:39,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-15 19:36:39,894 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2021-10-15 19:36:39,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-15 19:36:39,901 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-10-15 19:36:39,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-15 19:36:39,916 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2021-10-15 19:36:39,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-15 19:36:39,940 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2021-10-15 19:36:39,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-15 19:36:39,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-15 19:36:39,945 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-15 19:36:39,945 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1661009880] [2021-10-15 19:36:39,946 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1661009880] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-15 19:36:39,946 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-15 19:36:39,946 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-10-15 19:36:39,946 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [829536867] [2021-10-15 19:36:39,947 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-10-15 19:36:39,947 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-15 19:36:39,948 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-10-15 19:36:39,948 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2021-10-15 19:36:39,948 INFO L87 Difference]: Start difference. First operand 465 states and 555 transitions. Second operand has 12 states, 12 states have (on average 6.166666666666667) internal successors, (74), 5 states have internal predecessors, (74), 5 states have call successors, (10), 9 states have call predecessors, (10), 3 states have return successors, (8), 5 states have call predecessors, (8), 4 states have call successors, (8) [2021-10-15 19:36:41,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-15 19:36:41,609 INFO L93 Difference]: Finished difference Result 611 states and 714 transitions. [2021-10-15 19:36:41,609 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-10-15 19:36:41,609 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 6.166666666666667) internal successors, (74), 5 states have internal predecessors, (74), 5 states have call successors, (10), 9 states have call predecessors, (10), 3 states have return successors, (8), 5 states have call predecessors, (8), 4 states have call successors, (8) Word has length 92 [2021-10-15 19:36:41,609 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-15 19:36:41,611 INFO L225 Difference]: With dead ends: 611 [2021-10-15 19:36:41,611 INFO L226 Difference]: Without dead ends: 611 [2021-10-15 19:36:41,611 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 441.1ms TimeCoverageRelationStatistics Valid=124, Invalid=338, Unknown=0, NotChecked=0, Total=462 [2021-10-15 19:36:41,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 611 states. [2021-10-15 19:36:41,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 611 to 586. [2021-10-15 19:36:41,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 586 states, 462 states have (on average 1.2034632034632036) internal successors, (556), 470 states have internal predecessors, (556), 61 states have call successors, (61), 53 states have call predecessors, (61), 62 states have return successors, (72), 63 states have call predecessors, (72), 57 states have call successors, (72) [2021-10-15 19:36:41,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 586 states to 586 states and 689 transitions. [2021-10-15 19:36:41,618 INFO L78 Accepts]: Start accepts. Automaton has 586 states and 689 transitions. Word has length 92 [2021-10-15 19:36:41,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-15 19:36:41,618 INFO L470 AbstractCegarLoop]: Abstraction has 586 states and 689 transitions. [2021-10-15 19:36:41,618 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 6.166666666666667) internal successors, (74), 5 states have internal predecessors, (74), 5 states have call successors, (10), 9 states have call predecessors, (10), 3 states have return successors, (8), 5 states have call predecessors, (8), 4 states have call successors, (8) [2021-10-15 19:36:41,619 INFO L276 IsEmpty]: Start isEmpty. Operand 586 states and 689 transitions. [2021-10-15 19:36:41,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2021-10-15 19:36:41,620 INFO L504 BasicCegarLoop]: Found error trace [2021-10-15 19:36:41,620 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-15 19:36:41,620 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable51 [2021-10-15 19:36:41,620 INFO L402 AbstractCegarLoop]: === Iteration 53 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2021-10-15 19:36:41,620 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-15 19:36:41,621 INFO L82 PathProgramCache]: Analyzing trace with hash -605677229, now seen corresponding path program 1 times [2021-10-15 19:36:41,621 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-15 19:36:41,621 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1843834593] [2021-10-15 19:36:41,621 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-15 19:36:41,621 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-15 19:36:41,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-15 19:36:41,755 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-10-15 19:36:41,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-15 19:36:41,785 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-10-15 19:36:41,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-15 19:36:41,802 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-10-15 19:36:41,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-15 19:36:41,821 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-10-15 19:36:41,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-15 19:36:41,873 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2021-10-15 19:36:41,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-15 19:36:41,887 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-10-15 19:36:41,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-15 19:36:41,902 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2021-10-15 19:36:41,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-15 19:36:41,919 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2021-10-15 19:36:41,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-15 19:36:41,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-15 19:36:41,945 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-15 19:36:41,945 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1843834593] [2021-10-15 19:36:41,945 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1843834593] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-15 19:36:41,945 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-15 19:36:41,946 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2021-10-15 19:36:41,946 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1917001417] [2021-10-15 19:36:41,946 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2021-10-15 19:36:41,946 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-15 19:36:41,947 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-10-15 19:36:41,947 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=196, Unknown=0, NotChecked=0, Total=240 [2021-10-15 19:36:41,947 INFO L87 Difference]: Start difference. First operand 586 states and 689 transitions. Second operand has 16 states, 16 states have (on average 4.6875) internal successors, (75), 7 states have internal predecessors, (75), 2 states have call successors, (10), 9 states have call predecessors, (10), 3 states have return successors, (8), 3 states have call predecessors, (8), 1 states have call successors, (8) [2021-10-15 19:36:43,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-15 19:36:43,334 INFO L93 Difference]: Finished difference Result 587 states and 689 transitions. [2021-10-15 19:36:43,334 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-10-15 19:36:43,335 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 4.6875) internal successors, (75), 7 states have internal predecessors, (75), 2 states have call successors, (10), 9 states have call predecessors, (10), 3 states have return successors, (8), 3 states have call predecessors, (8), 1 states have call successors, (8) Word has length 93 [2021-10-15 19:36:43,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-15 19:36:43,336 INFO L225 Difference]: With dead ends: 587 [2021-10-15 19:36:43,337 INFO L226 Difference]: Without dead ends: 498 [2021-10-15 19:36:43,337 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 305.7ms TimeCoverageRelationStatistics Valid=81, Invalid=381, Unknown=0, NotChecked=0, Total=462 [2021-10-15 19:36:43,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 498 states. [2021-10-15 19:36:43,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 498 to 496. [2021-10-15 19:36:43,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 496 states, 387 states have (on average 1.20671834625323) internal successors, (467), 394 states have internal predecessors, (467), 54 states have call successors, (54), 47 states have call predecessors, (54), 54 states have return successors, (64), 55 states have call predecessors, (64), 51 states have call successors, (64) [2021-10-15 19:36:43,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 496 states to 496 states and 585 transitions. [2021-10-15 19:36:43,346 INFO L78 Accepts]: Start accepts. Automaton has 496 states and 585 transitions. Word has length 93 [2021-10-15 19:36:43,346 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-15 19:36:43,346 INFO L470 AbstractCegarLoop]: Abstraction has 496 states and 585 transitions. [2021-10-15 19:36:43,347 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 4.6875) internal successors, (75), 7 states have internal predecessors, (75), 2 states have call successors, (10), 9 states have call predecessors, (10), 3 states have return successors, (8), 3 states have call predecessors, (8), 1 states have call successors, (8) [2021-10-15 19:36:43,347 INFO L276 IsEmpty]: Start isEmpty. Operand 496 states and 585 transitions. [2021-10-15 19:36:43,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2021-10-15 19:36:43,349 INFO L504 BasicCegarLoop]: Found error trace [2021-10-15 19:36:43,349 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] [2021-10-15 19:36:43,349 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable52 [2021-10-15 19:36:43,350 INFO L402 AbstractCegarLoop]: === Iteration 54 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2021-10-15 19:36:43,350 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-15 19:36:43,350 INFO L82 PathProgramCache]: Analyzing trace with hash 612741088, now seen corresponding path program 1 times [2021-10-15 19:36:43,351 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-15 19:36:43,351 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2066620731] [2021-10-15 19:36:43,351 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-15 19:36:43,351 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-15 19:36:43,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-15 19:36:43,487 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-10-15 19:36:43,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-15 19:36:43,527 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-10-15 19:36:43,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-15 19:36:43,548 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-10-15 19:36:43,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-15 19:36:43,571 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-10-15 19:36:43,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-15 19:36:43,619 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-10-15 19:36:43,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-15 19:36:43,670 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-10-15 19:36:43,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-15 19:36:43,674 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-10-15 19:36:43,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-15 19:36:43,689 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-10-15 19:36:43,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-15 19:36:43,708 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2021-10-15 19:36:43,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-15 19:36:43,720 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2021-10-15 19:36:43,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-15 19:36:43,724 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-15 19:36:43,725 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-15 19:36:43,725 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2066620731] [2021-10-15 19:36:43,725 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2066620731] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-15 19:36:43,725 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-15 19:36:43,726 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2021-10-15 19:36:43,726 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [772212804] [2021-10-15 19:36:43,727 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2021-10-15 19:36:43,728 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-15 19:36:43,728 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-10-15 19:36:43,728 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=132, Unknown=0, NotChecked=0, Total=182 [2021-10-15 19:36:43,729 INFO L87 Difference]: Start difference. First operand 496 states and 585 transitions. Second operand has 14 states, 14 states have (on average 5.5) internal successors, (77), 5 states have internal predecessors, (77), 2 states have call successors, (12), 10 states have call predecessors, (12), 3 states have return successors, (10), 3 states have call predecessors, (10), 2 states have call successors, (10) [2021-10-15 19:36:44,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-15 19:36:44,442 INFO L93 Difference]: Finished difference Result 494 states and 580 transitions. [2021-10-15 19:36:44,442 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-10-15 19:36:44,442 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 5.5) internal successors, (77), 5 states have internal predecessors, (77), 2 states have call successors, (12), 10 states have call predecessors, (12), 3 states have return successors, (10), 3 states have call predecessors, (10), 2 states have call successors, (10) Word has length 99 [2021-10-15 19:36:44,443 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-15 19:36:44,444 INFO L225 Difference]: With dead ends: 494 [2021-10-15 19:36:44,444 INFO L226 Difference]: Without dead ends: 492 [2021-10-15 19:36:44,444 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 267.1ms TimeCoverageRelationStatistics Valid=64, Invalid=176, Unknown=0, NotChecked=0, Total=240 [2021-10-15 19:36:44,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 492 states. [2021-10-15 19:36:44,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 492 to 439. [2021-10-15 19:36:44,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 439 states, 343 states have (on average 1.19533527696793) internal successors, (410), 349 states have internal predecessors, (410), 47 states have call successors, (47), 42 states have call predecessors, (47), 48 states have return successors, (55), 48 states have call predecessors, (55), 44 states have call successors, (55) [2021-10-15 19:36:44,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 439 states to 439 states and 512 transitions. [2021-10-15 19:36:44,452 INFO L78 Accepts]: Start accepts. Automaton has 439 states and 512 transitions. Word has length 99 [2021-10-15 19:36:44,452 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-15 19:36:44,452 INFO L470 AbstractCegarLoop]: Abstraction has 439 states and 512 transitions. [2021-10-15 19:36:44,453 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 5.5) internal successors, (77), 5 states have internal predecessors, (77), 2 states have call successors, (12), 10 states have call predecessors, (12), 3 states have return successors, (10), 3 states have call predecessors, (10), 2 states have call successors, (10) [2021-10-15 19:36:44,453 INFO L276 IsEmpty]: Start isEmpty. Operand 439 states and 512 transitions. [2021-10-15 19:36:44,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2021-10-15 19:36:44,454 INFO L504 BasicCegarLoop]: Found error trace [2021-10-15 19:36:44,454 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] [2021-10-15 19:36:44,455 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable53 [2021-10-15 19:36:44,455 INFO L402 AbstractCegarLoop]: === Iteration 55 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2021-10-15 19:36:44,455 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-15 19:36:44,455 INFO L82 PathProgramCache]: Analyzing trace with hash -78015673, now seen corresponding path program 1 times [2021-10-15 19:36:44,455 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-15 19:36:44,455 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1766739653] [2021-10-15 19:36:44,456 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-15 19:36:44,456 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-15 19:36:44,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-15 19:36:44,609 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-10-15 19:36:44,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-15 19:36:44,650 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-10-15 19:36:44,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-15 19:36:44,670 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-10-15 19:36:44,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-15 19:36:44,692 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-10-15 19:36:44,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-15 19:36:44,759 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-10-15 19:36:44,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-15 19:36:44,791 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-10-15 19:36:44,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-15 19:36:44,795 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-10-15 19:36:44,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-15 19:36:44,808 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-10-15 19:36:44,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-15 19:36:44,826 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2021-10-15 19:36:44,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-15 19:36:44,835 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2021-10-15 19:36:44,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-15 19:36:44,840 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-15 19:36:44,840 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-15 19:36:44,840 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1766739653] [2021-10-15 19:36:44,840 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1766739653] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-15 19:36:44,841 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-15 19:36:44,841 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2021-10-15 19:36:44,841 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1273766569] [2021-10-15 19:36:44,842 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2021-10-15 19:36:44,842 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-15 19:36:44,842 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-10-15 19:36:44,843 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=158, Unknown=0, NotChecked=0, Total=210 [2021-10-15 19:36:44,843 INFO L87 Difference]: Start difference. First operand 439 states and 512 transitions. Second operand has 15 states, 15 states have (on average 5.133333333333334) internal successors, (77), 6 states have internal predecessors, (77), 4 states have call successors, (12), 10 states have call predecessors, (12), 2 states have return successors, (10), 4 states have call predecessors, (10), 3 states have call successors, (10) [2021-10-15 19:36:46,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-15 19:36:46,189 INFO L93 Difference]: Finished difference Result 839 states and 983 transitions. [2021-10-15 19:36:46,190 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2021-10-15 19:36:46,190 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 5.133333333333334) internal successors, (77), 6 states have internal predecessors, (77), 4 states have call successors, (12), 10 states have call predecessors, (12), 2 states have return successors, (10), 4 states have call predecessors, (10), 3 states have call successors, (10) Word has length 99 [2021-10-15 19:36:46,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-15 19:36:46,192 INFO L225 Difference]: With dead ends: 839 [2021-10-15 19:36:46,192 INFO L226 Difference]: Without dead ends: 797 [2021-10-15 19:36:46,193 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 116 ImplicationChecksByTransitivity, 506.6ms TimeCoverageRelationStatistics Valid=167, Invalid=589, Unknown=0, NotChecked=0, Total=756 [2021-10-15 19:36:46,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 797 states. [2021-10-15 19:36:46,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 797 to 419. [2021-10-15 19:36:46,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 419 states, 327 states have (on average 1.1957186544342508) internal successors, (391), 332 states have internal predecessors, (391), 44 states have call successors, (44), 41 states have call predecessors, (44), 47 states have return successors, (52), 45 states have call predecessors, (52), 41 states have call successors, (52) [2021-10-15 19:36:46,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 419 states to 419 states and 487 transitions. [2021-10-15 19:36:46,200 INFO L78 Accepts]: Start accepts. Automaton has 419 states and 487 transitions. Word has length 99 [2021-10-15 19:36:46,201 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-15 19:36:46,201 INFO L470 AbstractCegarLoop]: Abstraction has 419 states and 487 transitions. [2021-10-15 19:36:46,201 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 5.133333333333334) internal successors, (77), 6 states have internal predecessors, (77), 4 states have call successors, (12), 10 states have call predecessors, (12), 2 states have return successors, (10), 4 states have call predecessors, (10), 3 states have call successors, (10) [2021-10-15 19:36:46,201 INFO L276 IsEmpty]: Start isEmpty. Operand 419 states and 487 transitions. [2021-10-15 19:36:46,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2021-10-15 19:36:46,202 INFO L504 BasicCegarLoop]: Found error trace [2021-10-15 19:36:46,202 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] [2021-10-15 19:36:46,202 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable54 [2021-10-15 19:36:46,202 INFO L402 AbstractCegarLoop]: === Iteration 56 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2021-10-15 19:36:46,202 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-15 19:36:46,203 INFO L82 PathProgramCache]: Analyzing trace with hash 1954562899, now seen corresponding path program 1 times [2021-10-15 19:36:46,203 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-15 19:36:46,203 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1820581434] [2021-10-15 19:36:46,203 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-15 19:36:46,203 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-15 19:36:46,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-15 19:36:46,328 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-10-15 19:36:46,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-15 19:36:46,360 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-10-15 19:36:46,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-15 19:36:46,383 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-10-15 19:36:46,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-15 19:36:46,409 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-10-15 19:36:46,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-15 19:36:46,486 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2021-10-15 19:36:46,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-15 19:36:46,549 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-10-15 19:36:46,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-15 19:36:46,569 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-10-15 19:36:46,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-15 19:36:46,573 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-10-15 19:36:46,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-15 19:36:46,592 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-10-15 19:36:46,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-15 19:36:46,619 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2021-10-15 19:36:46,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-15 19:36:46,644 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-10-15 19:36:46,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-15 19:36:46,648 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2021-10-15 19:36:46,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-15 19:36:46,652 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-15 19:36:46,652 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-15 19:36:46,653 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1820581434] [2021-10-15 19:36:46,653 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1820581434] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-15 19:36:46,653 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-15 19:36:46,653 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2021-10-15 19:36:46,653 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1441556161] [2021-10-15 19:36:46,654 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2021-10-15 19:36:46,654 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-15 19:36:46,655 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-10-15 19:36:46,655 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=269, Unknown=0, NotChecked=0, Total=342 [2021-10-15 19:36:46,655 INFO L87 Difference]: Start difference. First operand 419 states and 487 transitions. Second operand has 19 states, 19 states have (on average 4.105263157894737) internal successors, (78), 7 states have internal predecessors, (78), 3 states have call successors, (14), 12 states have call predecessors, (14), 3 states have return successors, (12), 4 states have call predecessors, (12), 2 states have call successors, (12) [2021-10-15 19:36:47,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-15 19:36:47,623 INFO L93 Difference]: Finished difference Result 464 states and 541 transitions. [2021-10-15 19:36:47,623 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-10-15 19:36:47,623 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 4.105263157894737) internal successors, (78), 7 states have internal predecessors, (78), 3 states have call successors, (14), 12 states have call predecessors, (14), 3 states have return successors, (12), 4 states have call predecessors, (12), 2 states have call successors, (12) Word has length 104 [2021-10-15 19:36:47,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-15 19:36:47,625 INFO L225 Difference]: With dead ends: 464 [2021-10-15 19:36:47,625 INFO L226 Difference]: Without dead ends: 438 [2021-10-15 19:36:47,625 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 409.1ms TimeCoverageRelationStatistics Valid=114, Invalid=438, Unknown=0, NotChecked=0, Total=552 [2021-10-15 19:36:47,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 438 states. [2021-10-15 19:36:47,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 438 to 428. [2021-10-15 19:36:47,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 428 states, 335 states have (on average 1.182089552238806) internal successors, (396), 341 states have internal predecessors, (396), 45 states have call successors, (45), 41 states have call predecessors, (45), 47 states have return successors, (52), 45 states have call predecessors, (52), 41 states have call successors, (52) [2021-10-15 19:36:47,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 428 states to 428 states and 493 transitions. [2021-10-15 19:36:47,633 INFO L78 Accepts]: Start accepts. Automaton has 428 states and 493 transitions. Word has length 104 [2021-10-15 19:36:47,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-15 19:36:47,633 INFO L470 AbstractCegarLoop]: Abstraction has 428 states and 493 transitions. [2021-10-15 19:36:47,633 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 4.105263157894737) internal successors, (78), 7 states have internal predecessors, (78), 3 states have call successors, (14), 12 states have call predecessors, (14), 3 states have return successors, (12), 4 states have call predecessors, (12), 2 states have call successors, (12) [2021-10-15 19:36:47,634 INFO L276 IsEmpty]: Start isEmpty. Operand 428 states and 493 transitions. [2021-10-15 19:36:47,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2021-10-15 19:36:47,635 INFO L504 BasicCegarLoop]: Found error trace [2021-10-15 19:36:47,636 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-15 19:36:47,636 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable55 [2021-10-15 19:36:47,636 INFO L402 AbstractCegarLoop]: === Iteration 57 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2021-10-15 19:36:47,636 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-15 19:36:47,636 INFO L82 PathProgramCache]: Analyzing trace with hash 260351279, now seen corresponding path program 1 times [2021-10-15 19:36:47,636 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-15 19:36:47,637 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1740073394] [2021-10-15 19:36:47,637 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-15 19:36:47,637 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-15 19:36:47,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-15 19:36:47,776 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-10-15 19:36:47,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-15 19:36:47,811 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-10-15 19:36:47,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-15 19:36:47,826 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-10-15 19:36:47,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-15 19:36:47,836 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2021-10-15 19:36:47,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-15 19:36:47,846 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-10-15 19:36:47,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-15 19:36:47,849 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-10-15 19:36:47,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-15 19:36:47,859 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-10-15 19:36:47,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-15 19:36:47,872 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2021-10-15 19:36:47,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-15 19:36:47,941 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-10-15 19:36:47,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-15 19:36:47,967 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2021-10-15 19:36:47,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-15 19:36:47,976 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-10-15 19:36:47,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-15 19:36:47,980 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-10-15 19:36:47,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-15 19:36:47,983 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-10-15 19:36:47,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-15 19:36:47,987 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2021-10-15 19:36:47,987 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-15 19:36:47,988 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1740073394] [2021-10-15 19:36:47,988 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1740073394] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-15 19:36:47,988 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-15 19:36:47,988 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2021-10-15 19:36:47,989 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1940107531] [2021-10-15 19:36:47,989 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-10-15 19:36:47,989 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-15 19:36:47,990 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-10-15 19:36:47,990 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=109, Unknown=0, NotChecked=0, Total=156 [2021-10-15 19:36:47,990 INFO L87 Difference]: Start difference. First operand 428 states and 493 transitions. Second operand has 13 states, 13 states have (on average 5.076923076923077) internal successors, (66), 4 states have internal predecessors, (66), 2 states have call successors, (15), 10 states have call predecessors, (15), 3 states have return successors, (10), 3 states have call predecessors, (10), 2 states have call successors, (10) [2021-10-15 19:36:48,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-15 19:36:48,516 INFO L93 Difference]: Finished difference Result 440 states and 505 transitions. [2021-10-15 19:36:48,517 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-10-15 19:36:48,517 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 5.076923076923077) internal successors, (66), 4 states have internal predecessors, (66), 2 states have call successors, (15), 10 states have call predecessors, (15), 3 states have return successors, (10), 3 states have call predecessors, (10), 2 states have call successors, (10) Word has length 113 [2021-10-15 19:36:48,517 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-15 19:36:48,518 INFO L225 Difference]: With dead ends: 440 [2021-10-15 19:36:48,518 INFO L226 Difference]: Without dead ends: 440 [2021-10-15 19:36:48,518 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 261.6ms TimeCoverageRelationStatistics Valid=81, Invalid=225, Unknown=0, NotChecked=0, Total=306 [2021-10-15 19:36:48,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 440 states. [2021-10-15 19:36:48,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 440 to 436. [2021-10-15 19:36:48,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 436 states, 341 states have (on average 1.1788856304985338) internal successors, (402), 347 states have internal predecessors, (402), 45 states have call successors, (45), 41 states have call predecessors, (45), 49 states have return successors, (54), 47 states have call predecessors, (54), 41 states have call successors, (54) [2021-10-15 19:36:48,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 436 states to 436 states and 501 transitions. [2021-10-15 19:36:48,524 INFO L78 Accepts]: Start accepts. Automaton has 436 states and 501 transitions. Word has length 113 [2021-10-15 19:36:48,524 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-15 19:36:48,524 INFO L470 AbstractCegarLoop]: Abstraction has 436 states and 501 transitions. [2021-10-15 19:36:48,524 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 5.076923076923077) internal successors, (66), 4 states have internal predecessors, (66), 2 states have call successors, (15), 10 states have call predecessors, (15), 3 states have return successors, (10), 3 states have call predecessors, (10), 2 states have call successors, (10) [2021-10-15 19:36:48,525 INFO L276 IsEmpty]: Start isEmpty. Operand 436 states and 501 transitions. [2021-10-15 19:36:48,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2021-10-15 19:36:48,526 INFO L504 BasicCegarLoop]: Found error trace [2021-10-15 19:36:48,527 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-15 19:36:48,527 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable56 [2021-10-15 19:36:48,527 INFO L402 AbstractCegarLoop]: === Iteration 58 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2021-10-15 19:36:48,527 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-15 19:36:48,528 INFO L82 PathProgramCache]: Analyzing trace with hash 1796786958, now seen corresponding path program 1 times [2021-10-15 19:36:48,528 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-15 19:36:48,528 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1570508183] [2021-10-15 19:36:48,528 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-15 19:36:48,529 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-15 19:36:48,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-15 19:36:48,646 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-10-15 19:36:48,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-15 19:36:48,676 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-10-15 19:36:48,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-15 19:36:48,701 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-10-15 19:36:48,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-15 19:36:48,712 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2021-10-15 19:36:48,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-15 19:36:48,733 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-10-15 19:36:48,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-15 19:36:48,736 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-10-15 19:36:48,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-15 19:36:48,744 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-10-15 19:36:48,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-15 19:36:48,755 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2021-10-15 19:36:48,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-15 19:36:48,804 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-10-15 19:36:48,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-15 19:36:48,808 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2021-10-15 19:36:48,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-15 19:36:48,851 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-10-15 19:36:48,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-15 19:36:48,855 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-10-15 19:36:48,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-15 19:36:48,859 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-10-15 19:36:48,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-15 19:36:48,862 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2021-10-15 19:36:48,863 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-15 19:36:48,863 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1570508183] [2021-10-15 19:36:48,863 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1570508183] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-15 19:36:48,864 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-15 19:36:48,864 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2021-10-15 19:36:48,864 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1431727025] [2021-10-15 19:36:48,865 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2021-10-15 19:36:48,865 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-15 19:36:48,865 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-10-15 19:36:48,866 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=133, Unknown=0, NotChecked=0, Total=182 [2021-10-15 19:36:48,866 INFO L87 Difference]: Start difference. First operand 436 states and 501 transitions. Second operand has 14 states, 14 states have (on average 5.0) internal successors, (70), 5 states have internal predecessors, (70), 2 states have call successors, (15), 10 states have call predecessors, (15), 3 states have return successors, (10), 3 states have call predecessors, (10), 1 states have call successors, (10) [2021-10-15 19:36:49,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-15 19:36:49,601 INFO L93 Difference]: Finished difference Result 387 states and 434 transitions. [2021-10-15 19:36:49,601 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-10-15 19:36:49,601 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 5.0) internal successors, (70), 5 states have internal predecessors, (70), 2 states have call successors, (15), 10 states have call predecessors, (15), 3 states have return successors, (10), 3 states have call predecessors, (10), 1 states have call successors, (10) Word has length 113 [2021-10-15 19:36:49,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-15 19:36:49,602 INFO L225 Difference]: With dead ends: 387 [2021-10-15 19:36:49,602 INFO L226 Difference]: Without dead ends: 387 [2021-10-15 19:36:49,603 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 221.8ms TimeCoverageRelationStatistics Valid=75, Invalid=231, Unknown=0, NotChecked=0, Total=306 [2021-10-15 19:36:49,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 387 states. [2021-10-15 19:36:49,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 387 to 249. [2021-10-15 19:36:49,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 249 states, 195 states have (on average 1.1384615384615384) internal successors, (222), 197 states have internal predecessors, (222), 26 states have call successors, (26), 26 states have call predecessors, (26), 27 states have return successors, (27), 25 states have call predecessors, (27), 24 states have call successors, (27) [2021-10-15 19:36:49,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 249 states to 249 states and 275 transitions. [2021-10-15 19:36:49,609 INFO L78 Accepts]: Start accepts. Automaton has 249 states and 275 transitions. Word has length 113 [2021-10-15 19:36:49,609 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-15 19:36:49,609 INFO L470 AbstractCegarLoop]: Abstraction has 249 states and 275 transitions. [2021-10-15 19:36:49,609 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 5.0) internal successors, (70), 5 states have internal predecessors, (70), 2 states have call successors, (15), 10 states have call predecessors, (15), 3 states have return successors, (10), 3 states have call predecessors, (10), 1 states have call successors, (10) [2021-10-15 19:36:49,610 INFO L276 IsEmpty]: Start isEmpty. Operand 249 states and 275 transitions. [2021-10-15 19:36:49,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2021-10-15 19:36:49,611 INFO L504 BasicCegarLoop]: Found error trace [2021-10-15 19:36:49,611 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, 1] [2021-10-15 19:36:49,612 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable57 [2021-10-15 19:36:49,612 INFO L402 AbstractCegarLoop]: === Iteration 59 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2021-10-15 19:36:49,612 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-15 19:36:49,613 INFO L82 PathProgramCache]: Analyzing trace with hash 960404334, now seen corresponding path program 1 times [2021-10-15 19:36:49,613 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-15 19:36:49,613 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1308415500] [2021-10-15 19:36:49,613 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-15 19:36:49,613 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-15 19:36:49,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-15 19:36:49,749 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-10-15 19:36:49,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-15 19:36:49,776 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-10-15 19:36:49,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-15 19:36:49,792 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-10-15 19:36:49,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-15 19:36:49,810 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-10-15 19:36:49,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-15 19:36:49,860 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2021-10-15 19:36:49,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-15 19:36:49,914 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-10-15 19:36:49,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-15 19:36:49,931 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-10-15 19:36:49,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-15 19:36:49,935 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-10-15 19:36:49,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-15 19:36:49,950 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-10-15 19:36:49,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-15 19:36:49,969 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2021-10-15 19:36:49,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-15 19:36:49,986 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-10-15 19:36:49,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-15 19:36:49,990 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2021-10-15 19:36:49,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-15 19:36:50,013 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2021-10-15 19:36:50,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-15 19:36:50,016 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-15 19:36:50,017 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-15 19:36:50,017 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1308415500] [2021-10-15 19:36:50,017 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1308415500] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-15 19:36:50,017 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-15 19:36:50,018 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2021-10-15 19:36:50,018 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [404067647] [2021-10-15 19:36:50,018 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2021-10-15 19:36:50,019 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-15 19:36:50,019 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-10-15 19:36:50,019 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=145, Unknown=0, NotChecked=0, Total=210 [2021-10-15 19:36:50,020 INFO L87 Difference]: Start difference. First operand 249 states and 275 transitions. Second operand has 15 states, 15 states have (on average 6.133333333333334) internal successors, (92), 4 states have internal predecessors, (92), 2 states have call successors, (15), 12 states have call predecessors, (15), 3 states have return successors, (13), 3 states have call predecessors, (13), 2 states have call successors, (13) [2021-10-15 19:36:50,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-15 19:36:50,784 INFO L93 Difference]: Finished difference Result 263 states and 291 transitions. [2021-10-15 19:36:50,784 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-10-15 19:36:50,784 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 6.133333333333334) internal successors, (92), 4 states have internal predecessors, (92), 2 states have call successors, (15), 12 states have call predecessors, (15), 3 states have return successors, (13), 3 states have call predecessors, (13), 2 states have call successors, (13) Word has length 120 [2021-10-15 19:36:50,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-15 19:36:50,785 INFO L225 Difference]: With dead ends: 263 [2021-10-15 19:36:50,785 INFO L226 Difference]: Without dead ends: 263 [2021-10-15 19:36:50,786 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 393.0ms TimeCoverageRelationStatistics Valid=114, Invalid=228, Unknown=0, NotChecked=0, Total=342 [2021-10-15 19:36:50,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 263 states. [2021-10-15 19:36:50,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 263 to 253. [2021-10-15 19:36:50,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 253 states, 198 states have (on average 1.1363636363636365) internal successors, (225), 200 states have internal predecessors, (225), 26 states have call successors, (26), 26 states have call predecessors, (26), 28 states have return successors, (28), 26 states have call predecessors, (28), 24 states have call successors, (28) [2021-10-15 19:36:50,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 253 states to 253 states and 279 transitions. [2021-10-15 19:36:50,789 INFO L78 Accepts]: Start accepts. Automaton has 253 states and 279 transitions. Word has length 120 [2021-10-15 19:36:50,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-15 19:36:50,790 INFO L470 AbstractCegarLoop]: Abstraction has 253 states and 279 transitions. [2021-10-15 19:36:50,790 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 6.133333333333334) internal successors, (92), 4 states have internal predecessors, (92), 2 states have call successors, (15), 12 states have call predecessors, (15), 3 states have return successors, (13), 3 states have call predecessors, (13), 2 states have call successors, (13) [2021-10-15 19:36:50,790 INFO L276 IsEmpty]: Start isEmpty. Operand 253 states and 279 transitions. [2021-10-15 19:36:50,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2021-10-15 19:36:50,791 INFO L504 BasicCegarLoop]: Found error trace [2021-10-15 19:36:50,791 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, 1] [2021-10-15 19:36:50,792 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable58 [2021-10-15 19:36:50,792 INFO L402 AbstractCegarLoop]: === Iteration 60 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2021-10-15 19:36:50,792 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-15 19:36:50,792 INFO L82 PathProgramCache]: Analyzing trace with hash 1141890831, now seen corresponding path program 1 times [2021-10-15 19:36:50,792 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-15 19:36:50,792 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [634344167] [2021-10-15 19:36:50,793 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-15 19:36:50,793 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-15 19:36:50,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-15 19:36:50,921 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-10-15 19:36:50,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-15 19:36:50,952 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-10-15 19:36:50,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-15 19:36:50,965 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-10-15 19:36:50,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-15 19:36:50,979 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-10-15 19:36:50,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-15 19:36:51,022 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2021-10-15 19:36:51,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-15 19:36:51,074 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-10-15 19:36:51,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-15 19:36:51,089 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-10-15 19:36:51,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-15 19:36:51,092 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-10-15 19:36:51,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-15 19:36:51,106 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-10-15 19:36:51,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-15 19:36:51,124 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2021-10-15 19:36:51,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-15 19:36:51,155 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-10-15 19:36:51,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-15 19:36:51,159 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2021-10-15 19:36:51,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-15 19:36:51,163 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2021-10-15 19:36:51,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-15 19:36:51,167 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-15 19:36:51,168 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-15 19:36:51,168 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [634344167] [2021-10-15 19:36:51,168 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [634344167] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-15 19:36:51,168 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-15 19:36:51,169 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2021-10-15 19:36:51,169 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [766455896] [2021-10-15 19:36:51,169 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2021-10-15 19:36:51,170 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-15 19:36:51,170 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-10-15 19:36:51,170 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=145, Unknown=0, NotChecked=0, Total=210 [2021-10-15 19:36:51,171 INFO L87 Difference]: Start difference. First operand 253 states and 279 transitions. Second operand has 15 states, 15 states have (on average 6.133333333333334) internal successors, (92), 4 states have internal predecessors, (92), 2 states have call successors, (15), 12 states have call predecessors, (15), 3 states have return successors, (13), 3 states have call predecessors, (13), 2 states have call successors, (13) [2021-10-15 19:36:51,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-15 19:36:51,816 INFO L93 Difference]: Finished difference Result 263 states and 289 transitions. [2021-10-15 19:36:51,817 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-10-15 19:36:51,817 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 6.133333333333334) internal successors, (92), 4 states have internal predecessors, (92), 2 states have call successors, (15), 12 states have call predecessors, (15), 3 states have return successors, (13), 3 states have call predecessors, (13), 2 states have call successors, (13) Word has length 120 [2021-10-15 19:36:51,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-15 19:36:51,818 INFO L225 Difference]: With dead ends: 263 [2021-10-15 19:36:51,818 INFO L226 Difference]: Without dead ends: 254 [2021-10-15 19:36:51,818 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 300.6ms TimeCoverageRelationStatistics Valid=104, Invalid=238, Unknown=0, NotChecked=0, Total=342 [2021-10-15 19:36:51,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 254 states. [2021-10-15 19:36:51,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 254 to 248. [2021-10-15 19:36:51,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 248 states, 194 states have (on average 1.1288659793814433) internal successors, (219), 196 states have internal predecessors, (219), 26 states have call successors, (26), 26 states have call predecessors, (26), 27 states have return successors, (27), 25 states have call predecessors, (27), 24 states have call successors, (27) [2021-10-15 19:36:51,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 248 states to 248 states and 272 transitions. [2021-10-15 19:36:51,832 INFO L78 Accepts]: Start accepts. Automaton has 248 states and 272 transitions. Word has length 120 [2021-10-15 19:36:51,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-15 19:36:51,832 INFO L470 AbstractCegarLoop]: Abstraction has 248 states and 272 transitions. [2021-10-15 19:36:51,832 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 6.133333333333334) internal successors, (92), 4 states have internal predecessors, (92), 2 states have call successors, (15), 12 states have call predecessors, (15), 3 states have return successors, (13), 3 states have call predecessors, (13), 2 states have call successors, (13) [2021-10-15 19:36:51,832 INFO L276 IsEmpty]: Start isEmpty. Operand 248 states and 272 transitions. [2021-10-15 19:36:51,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2021-10-15 19:36:51,834 INFO L504 BasicCegarLoop]: Found error trace [2021-10-15 19:36:51,834 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-15 19:36:51,834 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable59 [2021-10-15 19:36:51,835 INFO L402 AbstractCegarLoop]: === Iteration 61 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2021-10-15 19:36:51,835 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-15 19:36:51,835 INFO L82 PathProgramCache]: Analyzing trace with hash 1073285628, now seen corresponding path program 1 times [2021-10-15 19:36:51,836 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-15 19:36:51,836 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1967313533] [2021-10-15 19:36:51,836 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-15 19:36:51,836 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-15 19:36:51,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-15 19:36:51,966 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-10-15 19:36:51,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-15 19:36:51,998 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-10-15 19:36:52,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-15 19:36:52,019 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-10-15 19:36:52,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-15 19:36:52,046 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-10-15 19:36:52,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-15 19:36:52,144 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2021-10-15 19:36:52,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-15 19:36:52,247 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-10-15 19:36:52,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-15 19:36:52,266 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-10-15 19:36:52,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-15 19:36:52,270 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-10-15 19:36:52,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-15 19:36:52,287 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-10-15 19:36:52,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-15 19:36:52,308 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2021-10-15 19:36:52,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-15 19:36:52,405 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-10-15 19:36:52,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-15 19:36:52,409 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2021-10-15 19:36:52,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-15 19:36:52,471 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-10-15 19:36:52,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-15 19:36:52,475 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-10-15 19:36:52,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-15 19:36:52,478 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-10-15 19:36:52,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-15 19:36:52,481 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2021-10-15 19:36:52,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-15 19:36:52,485 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2021-10-15 19:36:52,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-15 19:36:52,490 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2021-10-15 19:36:52,490 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-15 19:36:52,490 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1967313533] [2021-10-15 19:36:52,490 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1967313533] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-15 19:36:52,491 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-15 19:36:52,491 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [25] imperfect sequences [] total 25 [2021-10-15 19:36:52,491 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1116772280] [2021-10-15 19:36:52,492 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2021-10-15 19:36:52,492 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-15 19:36:52,492 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2021-10-15 19:36:52,493 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=515, Unknown=0, NotChecked=0, Total=600 [2021-10-15 19:36:52,493 INFO L87 Difference]: Start difference. First operand 248 states and 272 transitions. Second operand has 25 states, 25 states have (on average 4.04) internal successors, (101), 11 states have internal predecessors, (101), 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-15 19:36:53,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-15 19:36:53,808 INFO L93 Difference]: Finished difference Result 317 states and 357 transitions. [2021-10-15 19:36:53,808 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2021-10-15 19:36:53,808 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 4.04) internal successors, (101), 11 states have internal predecessors, (101), 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 150 [2021-10-15 19:36:53,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-15 19:36:53,809 INFO L225 Difference]: With dead ends: 317 [2021-10-15 19:36:53,809 INFO L226 Difference]: Without dead ends: 285 [2021-10-15 19:36:53,810 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 165 ImplicationChecksByTransitivity, 588.1ms TimeCoverageRelationStatistics Valid=148, Invalid=1042, Unknown=0, NotChecked=0, Total=1190 [2021-10-15 19:36:53,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 285 states. [2021-10-15 19:36:53,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 285 to 265. [2021-10-15 19:36:53,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 265 states, 209 states have (on average 1.138755980861244) internal successors, (238), 211 states have internal predecessors, (238), 26 states have call successors, (26), 26 states have call predecessors, (26), 29 states have return successors, (29), 27 states have call predecessors, (29), 24 states have call successors, (29) [2021-10-15 19:36:53,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 265 states to 265 states and 293 transitions. [2021-10-15 19:36:53,814 INFO L78 Accepts]: Start accepts. Automaton has 265 states and 293 transitions. Word has length 150 [2021-10-15 19:36:53,814 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-15 19:36:53,814 INFO L470 AbstractCegarLoop]: Abstraction has 265 states and 293 transitions. [2021-10-15 19:36:53,814 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 4.04) internal successors, (101), 11 states have internal predecessors, (101), 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-15 19:36:53,815 INFO L276 IsEmpty]: Start isEmpty. Operand 265 states and 293 transitions. [2021-10-15 19:36:53,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2021-10-15 19:36:53,816 INFO L504 BasicCegarLoop]: Found error trace [2021-10-15 19:36:53,817 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-15 19:36:53,817 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable60 [2021-10-15 19:36:53,817 INFO L402 AbstractCegarLoop]: === Iteration 62 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2021-10-15 19:36:53,818 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-15 19:36:53,818 INFO L82 PathProgramCache]: Analyzing trace with hash 1690329856, now seen corresponding path program 1 times [2021-10-15 19:36:53,818 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-15 19:36:53,818 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [276631702] [2021-10-15 19:36:53,819 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-15 19:36:53,819 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-15 19:36:53,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-15 19:36:53,992 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-10-15 19:36:53,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-15 19:36:54,034 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-10-15 19:36:54,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-15 19:36:54,056 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-10-15 19:36:54,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-15 19:36:54,081 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-10-15 19:36:54,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-15 19:36:54,158 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2021-10-15 19:36:54,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-15 19:36:54,246 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-10-15 19:36:54,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-15 19:36:54,264 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-10-15 19:36:54,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-15 19:36:54,266 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-10-15 19:36:54,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-15 19:36:54,281 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-10-15 19:36:54,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-15 19:36:54,299 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2021-10-15 19:36:54,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-15 19:36:54,380 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-10-15 19:36:54,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-15 19:36:54,383 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2021-10-15 19:36:54,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-15 19:36:54,425 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-10-15 19:36:54,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-15 19:36:54,430 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-10-15 19:36:54,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-15 19:36:54,432 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-10-15 19:36:54,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-15 19:36:54,435 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2021-10-15 19:36:54,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-15 19:36:54,437 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2021-10-15 19:36:54,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-15 19:36:54,441 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2021-10-15 19:36:54,441 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-15 19:36:54,441 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [276631702] [2021-10-15 19:36:54,441 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [276631702] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-15 19:36:54,441 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-15 19:36:54,442 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [24] imperfect sequences [] total 24 [2021-10-15 19:36:54,442 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [659985227] [2021-10-15 19:36:54,442 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2021-10-15 19:36:54,442 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-15 19:36:54,442 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2021-10-15 19:36:54,443 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=469, Unknown=0, NotChecked=0, Total=552 [2021-10-15 19:36:54,443 INFO L87 Difference]: Start difference. First operand 265 states and 293 transitions. Second operand has 24 states, 24 states have (on average 4.291666666666667) internal successors, (103), 10 states have internal predecessors, (103), 2 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-15 19:36:55,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-15 19:36:55,311 INFO L93 Difference]: Finished difference Result 284 states and 314 transitions. [2021-10-15 19:36:55,312 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2021-10-15 19:36:55,312 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 4.291666666666667) internal successors, (103), 10 states have internal predecessors, (103), 2 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 151 [2021-10-15 19:36:55,312 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-15 19:36:55,312 INFO L225 Difference]: With dead ends: 284 [2021-10-15 19:36:55,313 INFO L226 Difference]: Without dead ends: 279 [2021-10-15 19:36:55,313 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 122 ImplicationChecksByTransitivity, 488.2ms TimeCoverageRelationStatistics Valid=130, Invalid=740, Unknown=0, NotChecked=0, Total=870 [2021-10-15 19:36:55,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 279 states. [2021-10-15 19:36:55,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 279 to 265. [2021-10-15 19:36:55,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 265 states, 209 states have (on average 1.1339712918660287) internal successors, (237), 211 states have internal predecessors, (237), 26 states have call successors, (26), 26 states have call predecessors, (26), 29 states have return successors, (29), 27 states have call predecessors, (29), 24 states have call successors, (29) [2021-10-15 19:36:55,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 265 states to 265 states and 292 transitions. [2021-10-15 19:36:55,316 INFO L78 Accepts]: Start accepts. Automaton has 265 states and 292 transitions. Word has length 151 [2021-10-15 19:36:55,317 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-15 19:36:55,317 INFO L470 AbstractCegarLoop]: Abstraction has 265 states and 292 transitions. [2021-10-15 19:36:55,317 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 4.291666666666667) internal successors, (103), 10 states have internal predecessors, (103), 2 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-15 19:36:55,317 INFO L276 IsEmpty]: Start isEmpty. Operand 265 states and 292 transitions. [2021-10-15 19:36:55,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2021-10-15 19:36:55,319 INFO L504 BasicCegarLoop]: Found error trace [2021-10-15 19:36:55,319 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-15 19:36:55,319 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable61 [2021-10-15 19:36:55,320 INFO L402 AbstractCegarLoop]: === Iteration 63 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2021-10-15 19:36:55,320 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-15 19:36:55,320 INFO L82 PathProgramCache]: Analyzing trace with hash -206728514, now seen corresponding path program 1 times [2021-10-15 19:36:55,320 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-15 19:36:55,320 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2003803817] [2021-10-15 19:36:55,321 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-15 19:36:55,321 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-15 19:36:55,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-15 19:36:55,463 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-10-15 19:36:55,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-15 19:36:55,501 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-10-15 19:36:55,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-15 19:36:55,523 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-10-15 19:36:55,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-15 19:36:55,548 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-10-15 19:36:55,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-15 19:36:55,653 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2021-10-15 19:36:55,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-15 19:36:55,741 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-10-15 19:36:55,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-15 19:36:55,758 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-10-15 19:36:55,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-15 19:36:55,762 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-10-15 19:36:55,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-15 19:36:55,778 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-10-15 19:36:55,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-15 19:36:55,798 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2021-10-15 19:36:55,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-15 19:36:55,818 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-10-15 19:36:55,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-15 19:36:55,821 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2021-10-15 19:36:55,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-15 19:36:55,826 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-10-15 19:36:55,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-15 19:36:55,829 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-10-15 19:36:55,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-15 19:36:55,832 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-10-15 19:36:55,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-15 19:36:55,834 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2021-10-15 19:36:55,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-15 19:36:55,858 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2021-10-15 19:36:55,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-15 19:36:55,862 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2021-10-15 19:36:55,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-15 19:36:55,867 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2021-10-15 19:36:55,867 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-15 19:36:55,867 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2003803817] [2021-10-15 19:36:55,868 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2003803817] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-15 19:36:55,868 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-15 19:36:55,868 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2021-10-15 19:36:55,868 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1232398873] [2021-10-15 19:36:55,869 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2021-10-15 19:36:55,869 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-15 19:36:55,870 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2021-10-15 19:36:55,870 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=343, Unknown=0, NotChecked=0, Total=420 [2021-10-15 19:36:55,871 INFO L87 Difference]: Start difference. First operand 265 states and 292 transitions. Second operand has 21 states, 21 states have (on average 4.571428571428571) internal successors, (96), 8 states have internal predecessors, (96), 3 states have call successors, (17), 12 states have call predecessors, (17), 4 states have return successors, (15), 5 states have call predecessors, (15), 2 states have call successors, (15) [2021-10-15 19:36:56,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-15 19:36:56,951 INFO L93 Difference]: Finished difference Result 303 states and 337 transitions. [2021-10-15 19:36:56,951 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2021-10-15 19:36:56,951 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 4.571428571428571) internal successors, (96), 8 states have internal predecessors, (96), 3 states have call successors, (17), 12 states have call predecessors, (17), 4 states have return successors, (15), 5 states have call predecessors, (15), 2 states have call successors, (15) Word has length 153 [2021-10-15 19:36:56,952 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-15 19:36:56,952 INFO L225 Difference]: With dead ends: 303 [2021-10-15 19:36:56,952 INFO L226 Difference]: Without dead ends: 265 [2021-10-15 19:36:56,953 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 100 ImplicationChecksByTransitivity, 526.5ms TimeCoverageRelationStatistics Valid=141, Invalid=671, Unknown=0, NotChecked=0, Total=812 [2021-10-15 19:36:56,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 265 states. [2021-10-15 19:36:56,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 265 to 259. [2021-10-15 19:36:56,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 259 states, 205 states have (on average 1.1219512195121952) internal successors, (230), 207 states have internal predecessors, (230), 25 states have call successors, (25), 25 states have call predecessors, (25), 28 states have return successors, (28), 26 states have call predecessors, (28), 23 states have call successors, (28) [2021-10-15 19:36:56,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 259 states to 259 states and 283 transitions. [2021-10-15 19:36:56,956 INFO L78 Accepts]: Start accepts. Automaton has 259 states and 283 transitions. Word has length 153 [2021-10-15 19:36:56,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-15 19:36:56,956 INFO L470 AbstractCegarLoop]: Abstraction has 259 states and 283 transitions. [2021-10-15 19:36:56,956 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 4.571428571428571) internal successors, (96), 8 states have internal predecessors, (96), 3 states have call successors, (17), 12 states have call predecessors, (17), 4 states have return successors, (15), 5 states have call predecessors, (15), 2 states have call successors, (15) [2021-10-15 19:36:56,957 INFO L276 IsEmpty]: Start isEmpty. Operand 259 states and 283 transitions. [2021-10-15 19:36:56,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2021-10-15 19:36:56,957 INFO L504 BasicCegarLoop]: Found error trace [2021-10-15 19:36:56,958 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-15 19:36:56,958 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable62 [2021-10-15 19:36:56,958 INFO L402 AbstractCegarLoop]: === Iteration 64 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2021-10-15 19:36:56,958 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-15 19:36:56,959 INFO L82 PathProgramCache]: Analyzing trace with hash -1217289252, now seen corresponding path program 1 times [2021-10-15 19:36:56,959 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-15 19:36:56,959 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [78740388] [2021-10-15 19:36:56,959 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-15 19:36:56,959 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-15 19:36:56,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-15 19:36:57,086 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-10-15 19:36:57,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-15 19:36:57,116 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-10-15 19:36:57,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-15 19:36:57,136 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-10-15 19:36:57,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-15 19:36:57,161 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-10-15 19:36:57,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-15 19:36:57,229 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2021-10-15 19:36:57,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-15 19:36:57,280 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-10-15 19:36:57,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-15 19:36:57,296 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-10-15 19:36:57,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-15 19:36:57,300 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-10-15 19:36:57,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-15 19:36:57,314 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-10-15 19:36:57,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-15 19:36:57,333 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2021-10-15 19:36:57,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-15 19:36:57,351 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-10-15 19:36:57,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-15 19:36:57,354 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2021-10-15 19:36:57,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-15 19:36:57,367 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-10-15 19:36:57,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-15 19:36:57,371 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-10-15 19:36:57,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-15 19:36:57,374 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-10-15 19:36:57,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-15 19:36:57,377 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2021-10-15 19:36:57,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-15 19:36:57,383 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2021-10-15 19:36:57,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-15 19:36:57,387 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2021-10-15 19:36:57,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-15 19:36:57,392 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2021-10-15 19:36:57,393 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-15 19:36:57,393 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [78740388] [2021-10-15 19:36:57,393 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [78740388] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-15 19:36:57,394 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-15 19:36:57,394 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2021-10-15 19:36:57,395 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [109657137] [2021-10-15 19:36:57,396 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2021-10-15 19:36:57,397 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-15 19:36:57,397 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-10-15 19:36:57,397 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=145, Unknown=0, NotChecked=0, Total=210 [2021-10-15 19:36:57,398 INFO L87 Difference]: Start difference. First operand 259 states and 283 transitions. Second operand has 15 states, 15 states have (on average 6.733333333333333) internal successors, (101), 5 states have internal predecessors, (101), 4 states have call successors, (17), 12 states have call predecessors, (17), 2 states have return successors, (15), 4 states have call predecessors, (15), 3 states have call successors, (15) [2021-10-15 19:36:57,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-15 19:36:57,989 INFO L93 Difference]: Finished difference Result 256 states and 277 transitions. [2021-10-15 19:36:57,989 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-10-15 19:36:57,990 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 6.733333333333333) internal successors, (101), 5 states have internal predecessors, (101), 4 states have call successors, (17), 12 states have call predecessors, (17), 2 states have return successors, (15), 4 states have call predecessors, (15), 3 states have call successors, (15) Word has length 158 [2021-10-15 19:36:57,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-15 19:36:57,991 INFO L225 Difference]: With dead ends: 256 [2021-10-15 19:36:57,991 INFO L226 Difference]: Without dead ends: 245 [2021-10-15 19:36:57,991 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 77 ImplicationChecksByTransitivity, 422.2ms TimeCoverageRelationStatistics Valid=147, Invalid=405, Unknown=0, NotChecked=0, Total=552 [2021-10-15 19:36:57,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 245 states. [2021-10-15 19:36:57,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 245 to 231. [2021-10-15 19:36:57,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 231 states, 181 states have (on average 1.1049723756906078) internal successors, (200), 183 states have internal predecessors, (200), 24 states have call successors, (24), 24 states have call predecessors, (24), 25 states have return successors, (25), 23 states have call predecessors, (25), 22 states have call successors, (25) [2021-10-15 19:36:57,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 231 states to 231 states and 249 transitions. [2021-10-15 19:36:57,995 INFO L78 Accepts]: Start accepts. Automaton has 231 states and 249 transitions. Word has length 158 [2021-10-15 19:36:57,995 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-15 19:36:57,996 INFO L470 AbstractCegarLoop]: Abstraction has 231 states and 249 transitions. [2021-10-15 19:36:57,996 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 6.733333333333333) internal successors, (101), 5 states have internal predecessors, (101), 4 states have call successors, (17), 12 states have call predecessors, (17), 2 states have return successors, (15), 4 states have call predecessors, (15), 3 states have call successors, (15) [2021-10-15 19:36:57,996 INFO L276 IsEmpty]: Start isEmpty. Operand 231 states and 249 transitions. [2021-10-15 19:36:57,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2021-10-15 19:36:57,997 INFO L504 BasicCegarLoop]: Found error trace [2021-10-15 19:36:57,998 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-15 19:36:57,998 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable63 [2021-10-15 19:36:57,998 INFO L402 AbstractCegarLoop]: === Iteration 65 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2021-10-15 19:36:57,998 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-15 19:36:57,999 INFO L82 PathProgramCache]: Analyzing trace with hash 1524054683, now seen corresponding path program 1 times [2021-10-15 19:36:57,999 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-15 19:36:57,999 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [232620416] [2021-10-15 19:36:57,999 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-15 19:36:58,000 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-15 19:36:58,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-15 19:36:58,158 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-10-15 19:36:58,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-15 19:36:58,193 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-10-15 19:36:58,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-15 19:36:58,210 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-10-15 19:36:58,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-15 19:36:58,233 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-10-15 19:36:58,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-15 19:36:58,290 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2021-10-15 19:36:58,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-15 19:36:58,329 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-10-15 19:36:58,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-15 19:36:58,342 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-10-15 19:36:58,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-15 19:36:58,346 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-10-15 19:36:58,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-15 19:36:58,358 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-10-15 19:36:58,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-15 19:36:58,374 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2021-10-15 19:36:58,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-15 19:36:58,422 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-10-15 19:36:58,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-15 19:36:58,426 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2021-10-15 19:36:58,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-15 19:36:58,467 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-10-15 19:36:58,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-15 19:36:58,471 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-10-15 19:36:58,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-15 19:36:58,474 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-10-15 19:36:58,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-15 19:36:58,517 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2021-10-15 19:36:58,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-15 19:36:58,522 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2021-10-15 19:36:58,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-15 19:36:58,525 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2021-10-15 19:36:58,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-15 19:36:58,529 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2021-10-15 19:36:58,530 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-15 19:36:58,530 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [232620416] [2021-10-15 19:36:58,530 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [232620416] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-15 19:36:58,530 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-15 19:36:58,531 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2021-10-15 19:36:58,531 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [202983991] [2021-10-15 19:36:58,531 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2021-10-15 19:36:58,532 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-15 19:36:58,532 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2021-10-15 19:36:58,533 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=194, Unknown=0, NotChecked=0, Total=272 [2021-10-15 19:36:58,533 INFO L87 Difference]: Start difference. First operand 231 states and 249 transitions. Second operand has 17 states, 17 states have (on average 6.411764705882353) internal successors, (109), 5 states have internal predecessors, (109), 2 states have call successors, (17), 13 states have call predecessors, (17), 3 states have return successors, (15), 3 states have call predecessors, (15), 2 states have call successors, (15) [2021-10-15 19:36:58,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-15 19:36:58,993 INFO L93 Difference]: Finished difference Result 220 states and 235 transitions. [2021-10-15 19:36:58,994 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-10-15 19:36:58,994 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 6.411764705882353) internal successors, (109), 5 states have internal predecessors, (109), 2 states have call successors, (17), 13 states have call predecessors, (17), 3 states have return successors, (15), 3 states have call predecessors, (15), 2 states have call successors, (15) Word has length 160 [2021-10-15 19:36:58,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-15 19:36:58,995 INFO L225 Difference]: With dead ends: 220 [2021-10-15 19:36:58,995 INFO L226 Difference]: Without dead ends: 210 [2021-10-15 19:36:58,995 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 92 ImplicationChecksByTransitivity, 377.2ms TimeCoverageRelationStatistics Valid=124, Invalid=338, Unknown=0, NotChecked=0, Total=462 [2021-10-15 19:36:58,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210 states. [2021-10-15 19:36:58,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210 to 210. [2021-10-15 19:36:58,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 210 states, 163 states have (on average 1.0920245398773005) internal successors, (178), 164 states have internal predecessors, (178), 23 states have call successors, (23), 23 states have call predecessors, (23), 23 states have return successors, (23), 22 states have call predecessors, (23), 21 states have call successors, (23) [2021-10-15 19:36:58,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 224 transitions. [2021-10-15 19:36:58,998 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 224 transitions. Word has length 160 [2021-10-15 19:36:58,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-15 19:36:58,999 INFO L470 AbstractCegarLoop]: Abstraction has 210 states and 224 transitions. [2021-10-15 19:36:58,999 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 6.411764705882353) internal successors, (109), 5 states have internal predecessors, (109), 2 states have call successors, (17), 13 states have call predecessors, (17), 3 states have return successors, (15), 3 states have call predecessors, (15), 2 states have call successors, (15) [2021-10-15 19:36:58,999 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 224 transitions. [2021-10-15 19:36:59,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2021-10-15 19:36:59,000 INFO L504 BasicCegarLoop]: Found error trace [2021-10-15 19:36:59,001 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-15 19:36:59,001 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable64 [2021-10-15 19:36:59,001 INFO L402 AbstractCegarLoop]: === Iteration 66 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2021-10-15 19:36:59,002 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-15 19:36:59,002 INFO L82 PathProgramCache]: Analyzing trace with hash -1861413762, now seen corresponding path program 1 times [2021-10-15 19:36:59,002 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-15 19:36:59,002 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [633783121] [2021-10-15 19:36:59,002 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-15 19:36:59,003 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-15 19:36:59,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-15 19:36:59,160 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-10-15 19:36:59,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-15 19:36:59,187 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-10-15 19:36:59,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-15 19:36:59,203 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-10-15 19:36:59,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-15 19:36:59,225 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-10-15 19:36:59,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-15 19:36:59,302 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2021-10-15 19:36:59,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-15 19:36:59,375 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-10-15 19:36:59,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-15 19:36:59,394 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-10-15 19:36:59,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-15 19:36:59,398 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-10-15 19:36:59,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-15 19:36:59,414 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-10-15 19:36:59,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-15 19:36:59,433 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2021-10-15 19:36:59,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-15 19:36:59,489 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-10-15 19:36:59,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-15 19:36:59,497 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2021-10-15 19:36:59,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-15 19:36:59,503 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-10-15 19:36:59,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-15 19:36:59,507 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-10-15 19:36:59,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-15 19:36:59,510 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-10-15 19:36:59,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-15 19:36:59,532 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2021-10-15 19:36:59,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-15 19:36:59,536 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2021-10-15 19:36:59,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-15 19:36:59,540 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2021-10-15 19:36:59,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-15 19:36:59,546 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2021-10-15 19:36:59,547 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-15 19:36:59,547 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [633783121] [2021-10-15 19:36:59,547 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [633783121] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-15 19:36:59,547 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-15 19:36:59,548 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2021-10-15 19:36:59,548 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [669425930] [2021-10-15 19:36:59,548 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2021-10-15 19:36:59,549 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-15 19:36:59,549 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2021-10-15 19:36:59,549 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=293, Unknown=0, NotChecked=0, Total=380 [2021-10-15 19:36:59,550 INFO L87 Difference]: Start difference. First operand 210 states and 224 transitions. Second operand has 20 states, 20 states have (on average 5.35) internal successors, (107), 8 states have internal predecessors, (107), 5 states have call successors, (17), 13 states have call predecessors, (17), 3 states have return successors, (15), 6 states have call predecessors, (15), 4 states have call successors, (15) [2021-10-15 19:37:01,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-15 19:37:01,119 INFO L93 Difference]: Finished difference Result 355 states and 377 transitions. [2021-10-15 19:37:01,119 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2021-10-15 19:37:01,119 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 5.35) internal successors, (107), 8 states have internal predecessors, (107), 5 states have call successors, (17), 13 states have call predecessors, (17), 3 states have return successors, (15), 6 states have call predecessors, (15), 4 states have call successors, (15) Word has length 161 [2021-10-15 19:37:01,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-15 19:37:01,120 INFO L225 Difference]: With dead ends: 355 [2021-10-15 19:37:01,120 INFO L226 Difference]: Without dead ends: 213 [2021-10-15 19:37:01,120 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 541 ImplicationChecksByTransitivity, 925.4ms TimeCoverageRelationStatistics Valid=387, Invalid=1965, Unknown=0, NotChecked=0, Total=2352 [2021-10-15 19:37:01,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states. [2021-10-15 19:37:01,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 210. [2021-10-15 19:37:01,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 210 states, 163 states have (on average 1.0858895705521472) internal successors, (177), 164 states have internal predecessors, (177), 23 states have call successors, (23), 23 states have call predecessors, (23), 23 states have return successors, (23), 22 states have call predecessors, (23), 21 states have call successors, (23) [2021-10-15 19:37:01,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 223 transitions. [2021-10-15 19:37:01,123 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 223 transitions. Word has length 161 [2021-10-15 19:37:01,123 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-15 19:37:01,123 INFO L470 AbstractCegarLoop]: Abstraction has 210 states and 223 transitions. [2021-10-15 19:37:01,123 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 5.35) internal successors, (107), 8 states have internal predecessors, (107), 5 states have call successors, (17), 13 states have call predecessors, (17), 3 states have return successors, (15), 6 states have call predecessors, (15), 4 states have call successors, (15) [2021-10-15 19:37:01,124 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 223 transitions. [2021-10-15 19:37:01,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2021-10-15 19:37:01,125 INFO L504 BasicCegarLoop]: Found error trace [2021-10-15 19:37:01,125 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-15 19:37:01,125 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable65 [2021-10-15 19:37:01,125 INFO L402 AbstractCegarLoop]: === Iteration 67 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2021-10-15 19:37:01,126 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-15 19:37:01,126 INFO L82 PathProgramCache]: Analyzing trace with hash 1510386108, now seen corresponding path program 1 times [2021-10-15 19:37:01,126 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-15 19:37:01,126 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1258265527] [2021-10-15 19:37:01,127 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-15 19:37:01,127 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-15 19:37:01,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-15 19:37:01,307 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-10-15 19:37:01,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-15 19:37:01,347 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-10-15 19:37:01,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-15 19:37:01,370 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-10-15 19:37:01,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-15 19:37:01,397 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-10-15 19:37:01,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-15 19:37:01,544 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2021-10-15 19:37:01,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-15 19:37:01,645 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-10-15 19:37:01,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-15 19:37:01,673 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-10-15 19:37:01,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-15 19:37:01,677 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-10-15 19:37:01,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-15 19:37:01,702 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-10-15 19:37:01,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-15 19:37:01,731 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2021-10-15 19:37:01,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-15 19:37:01,809 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-10-15 19:37:01,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-15 19:37:01,813 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2021-10-15 19:37:01,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-15 19:37:01,819 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-10-15 19:37:01,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-15 19:37:01,823 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-10-15 19:37:01,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-15 19:37:01,826 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-10-15 19:37:01,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-15 19:37:01,858 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2021-10-15 19:37:01,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-15 19:37:01,864 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2021-10-15 19:37:01,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-15 19:37:01,867 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2021-10-15 19:37:01,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-15 19:37:01,872 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2021-10-15 19:37:01,872 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-15 19:37:01,872 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1258265527] [2021-10-15 19:37:01,873 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1258265527] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-15 19:37:01,873 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-15 19:37:01,873 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [25] imperfect sequences [] total 25 [2021-10-15 19:37:01,873 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1079133715] [2021-10-15 19:37:01,874 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2021-10-15 19:37:01,874 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-15 19:37:01,874 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2021-10-15 19:37:01,875 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=503, Unknown=0, NotChecked=0, Total=600 [2021-10-15 19:37:01,875 INFO L87 Difference]: Start difference. First operand 210 states and 223 transitions. Second operand has 25 states, 25 states have (on average 4.28) internal successors, (107), 11 states have internal predecessors, (107), 5 states have call successors, (17), 13 states have call predecessors, (17), 4 states have return successors, (15), 7 states have call predecessors, (15), 4 states have call successors, (15) [2021-10-15 19:37:03,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-15 19:37:03,216 INFO L93 Difference]: Finished difference Result 210 states and 224 transitions. [2021-10-15 19:37:03,217 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2021-10-15 19:37:03,217 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 4.28) internal successors, (107), 11 states have internal predecessors, (107), 5 states have call successors, (17), 13 states have call predecessors, (17), 4 states have return successors, (15), 7 states have call predecessors, (15), 4 states have call successors, (15) Word has length 161 [2021-10-15 19:37:03,217 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-15 19:37:03,217 INFO L225 Difference]: With dead ends: 210 [2021-10-15 19:37:03,217 INFO L226 Difference]: Without dead ends: 0 [2021-10-15 19:37:03,218 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 324 ImplicationChecksByTransitivity, 948.2ms TimeCoverageRelationStatistics Valid=265, Invalid=1715, Unknown=0, NotChecked=0, Total=1980 [2021-10-15 19:37:03,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2021-10-15 19:37:03,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2021-10-15 19:37:03,218 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-15 19:37:03,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2021-10-15 19:37:03,219 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 161 [2021-10-15 19:37:03,219 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-15 19:37:03,219 INFO L470 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-10-15 19:37:03,219 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 4.28) internal successors, (107), 11 states have internal predecessors, (107), 5 states have call successors, (17), 13 states have call predecessors, (17), 4 states have return successors, (15), 7 states have call predecessors, (15), 4 states have call successors, (15) [2021-10-15 19:37:03,219 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2021-10-15 19:37:03,219 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-10-15 19:37:03,222 INFO L764 garLoopResultBuilder]: Registering result SAFE for location mainErr0ENSURES_VIOLATIONMEMORY_LEAK [2021-10-15 19:37:03,223 INFO L764 garLoopResultBuilder]: Registering result SAFE for location errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK [2021-10-15 19:37:03,223 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable66 [2021-10-15 19:37:03,228 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-10-15 19:37:03,230 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.10 07:37:03 BoogieIcfgContainer [2021-10-15 19:37:03,230 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-10-15 19:37:03,231 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-10-15 19:37:03,231 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-10-15 19:37:03,232 INFO L275 PluginConnector]: Witness Printer initialized [2021-10-15 19:37:03,232 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 07:34:59" (3/4) ... [2021-10-15 19:37:03,236 INFO L137 WitnessPrinter]: Generating witness for correct program [2021-10-15 19:37:03,245 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure reach_error [2021-10-15 19:37:03,245 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure IoRegisterDeviceInterface [2021-10-15 19:37:03,245 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure _BLAST_init [2021-10-15 19:37:03,245 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure FloppyProcessQueuedRequests [2021-10-15 19:37:03,246 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure IoSetDeviceInterfaceState [2021-10-15 19:37:03,246 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure FloppyPnp [2021-10-15 19:37:03,246 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2021-10-15 19:37:03,246 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure FloppyCreateClose [2021-10-15 19:37:03,246 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure stubMoreProcessingRequired [2021-10-15 19:37:03,246 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure FloppyPnpComplete [2021-10-15 19:37:03,246 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure KeWaitForSingleObject [2021-10-15 19:37:03,247 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure IofCompleteRequest [2021-10-15 19:37:03,247 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure FloppyStartDevice [2021-10-15 19:37:03,247 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure PsCreateSystemThread [2021-10-15 19:37:03,247 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ObReferenceObjectByHandle [2021-10-15 19:37:03,247 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure IoBuildDeviceIoControlRequest [2021-10-15 19:37:03,247 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure KeSetEvent [2021-10-15 19:37:03,247 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure stub_driver_init [2021-10-15 19:37:03,248 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure errorFn [2021-10-15 19:37:03,248 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure FlQueueIrpToThread [2021-10-15 19:37:03,248 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure IofCallDriver [2021-10-15 19:37:03,248 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure FloppyDeviceControl [2021-10-15 19:37:03,248 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure FlCheckFormatParameters [2021-10-15 19:37:03,248 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2021-10-15 19:37:03,248 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure FloppyQueueRequest [2021-10-15 19:37:03,248 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure FlFdcDeviceIo [2021-10-15 19:37:03,249 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure FlAcpiConfigureFloppy [2021-10-15 19:37:03,249 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure IoDeleteSymbolicLink [2021-10-15 19:37:03,249 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure IoQueryDeviceDescription [2021-10-15 19:37:03,249 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ZwClose [2021-10-15 19:37:03,274 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 86 nodes and edges [2021-10-15 19:37:03,277 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 55 nodes and edges [2021-10-15 19:37:03,281 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2021-10-15 19:37:03,284 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2021-10-15 19:37:03,509 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e01e5a5b-1932-41cb-a6fe-ecb6f7d04a98/bin/uautomizer-hJ6jxDFKc3/witness.graphml [2021-10-15 19:37:03,509 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-10-15 19:37:03,511 INFO L168 Benchmark]: Toolchain (without parser) took 127065.85 ms. Allocated memory was 98.6 MB in the beginning and 373.3 MB in the end (delta: 274.7 MB). Free memory was 58.6 MB in the beginning and 125.7 MB in the end (delta: -67.1 MB). Peak memory consumption was 206.4 MB. Max. memory is 16.1 GB. [2021-10-15 19:37:03,512 INFO L168 Benchmark]: CDTParser took 0.43 ms. Allocated memory is still 98.6 MB. Free memory is still 76.0 MB. There was no memory consumed. Max. memory is 16.1 GB. [2021-10-15 19:37:03,512 INFO L168 Benchmark]: CACSL2BoogieTranslator took 793.09 ms. Allocated memory is still 98.6 MB. Free memory was 58.4 MB in the beginning and 59.9 MB in the end (delta: -1.5 MB). Peak memory consumption was 6.3 MB. Max. memory is 16.1 GB. [2021-10-15 19:37:03,513 INFO L168 Benchmark]: Boogie Preprocessor took 196.22 ms. Allocated memory is still 98.6 MB. Free memory was 59.9 MB in the beginning and 55.5 MB in the end (delta: 4.4 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. [2021-10-15 19:37:03,514 INFO L168 Benchmark]: RCFGBuilder took 1645.71 ms. Allocated memory was 98.6 MB in the beginning and 142.6 MB in the end (delta: 44.0 MB). Free memory was 55.5 MB in the beginning and 85.6 MB in the end (delta: -30.1 MB). Peak memory consumption was 30.5 MB. Max. memory is 16.1 GB. [2021-10-15 19:37:03,515 INFO L168 Benchmark]: TraceAbstraction took 124144.77 ms. Allocated memory was 142.6 MB in the beginning and 373.3 MB in the end (delta: 230.7 MB). Free memory was 85.1 MB in the beginning and 151.4 MB in the end (delta: -66.3 MB). Peak memory consumption was 165.4 MB. Max. memory is 16.1 GB. [2021-10-15 19:37:03,515 INFO L168 Benchmark]: Witness Printer took 278.02 ms. Allocated memory is still 373.3 MB. Free memory was 151.4 MB in the beginning and 125.7 MB in the end (delta: 25.7 MB). Peak memory consumption was 25.2 MB. Max. memory is 16.1 GB. [2021-10-15 19:37:03,518 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.43 ms. Allocated memory is still 98.6 MB. Free memory is still 76.0 MB. There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 793.09 ms. Allocated memory is still 98.6 MB. Free memory was 58.4 MB in the beginning and 59.9 MB in the end (delta: -1.5 MB). Peak memory consumption was 6.3 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 196.22 ms. Allocated memory is still 98.6 MB. Free memory was 59.9 MB in the beginning and 55.5 MB in the end (delta: 4.4 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. * RCFGBuilder took 1645.71 ms. Allocated memory was 98.6 MB in the beginning and 142.6 MB in the end (delta: 44.0 MB). Free memory was 55.5 MB in the beginning and 85.6 MB in the end (delta: -30.1 MB). Peak memory consumption was 30.5 MB. Max. memory is 16.1 GB. * TraceAbstraction took 124144.77 ms. Allocated memory was 142.6 MB in the beginning and 373.3 MB in the end (delta: 230.7 MB). Free memory was 85.1 MB in the beginning and 151.4 MB in the end (delta: -66.3 MB). Peak memory consumption was 165.4 MB. Max. memory is 16.1 GB. * Witness Printer took 278.02 ms. Allocated memory is still 373.3 MB. Free memory was 151.4 MB in the beginning and 125.7 MB in the end (delta: 25.7 MB). Peak memory consumption was 25.2 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: 667]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - PositiveResult [Line: 1627]: 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 31 procedures, 396 locations, 2 error locations. Started 1 CEGAR loops. OverallTime: 124060.2ms, OverallIterations: 67, TraceHistogramMax: 2, EmptinessCheckTime: 136.7ms, AutomataDifference: 99248.0ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 26.6ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 24799 SDtfs, 35964 SDslu, 53376 SDs, 0 SdLazy, 91602 SolverSat, 11213 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 70605.0ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1881 GetRequests, 847 SyntacticMatches, 0 SemanticMatches, 1034 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3103 ImplicationChecksByTransitivity, 25000.8ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=932occurred in iteration=20, InterpolantAutomatonStates: 863, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: 1311.9ms AutomataMinimizationTime, 67 MinimizatonAttempts, 3040 StatesRemovedByMinimization, 65 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 381.0ms SsaConstructionTime, 1127.3ms SatisfiabilityAnalysisTime, 20994.4ms InterpolantComputationTime, 4766 NumberOfCodeBlocks, 4766 NumberOfCodeBlocksAsserted, 67 NumberOfCheckSat, 4699 ConstructedInterpolants, 0 QuantifiedInterpolants, 21826 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 67 InterpolantComputations, 67 PerfectInterpolantSequences, 229/229 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-15 19:37:03,584 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e01e5a5b-1932-41cb-a6fe-ecb6f7d04a98/bin/uautomizer-hJ6jxDFKc3/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request...