./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/ntdrivers-simplified/floppy_simpl3.cil-2.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 20ed64ec Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/ntdrivers-simplified/floppy_simpl3.cil-2.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --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 9caca1067e52a4490439beb955df6129aef4eea8 ...................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.2.1-dev-20ed64e [2021-08-27 07:48:41,201 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-08-27 07:48:41,202 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-08-27 07:48:41,244 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-08-27 07:48:41,245 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-08-27 07:48:41,249 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-08-27 07:48:41,250 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-08-27 07:48:41,255 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-08-27 07:48:41,258 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-08-27 07:48:41,262 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-08-27 07:48:41,263 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-08-27 07:48:41,267 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-08-27 07:48:41,267 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-08-27 07:48:41,270 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-08-27 07:48:41,271 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-08-27 07:48:41,274 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-08-27 07:48:41,275 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-08-27 07:48:41,276 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-08-27 07:48:41,278 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-08-27 07:48:41,284 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-08-27 07:48:41,285 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-08-27 07:48:41,286 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-08-27 07:48:41,287 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-08-27 07:48:41,289 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-08-27 07:48:41,295 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-08-27 07:48:41,296 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-08-27 07:48:41,296 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-08-27 07:48:41,297 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-08-27 07:48:41,297 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-08-27 07:48:41,298 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-08-27 07:48:41,298 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-08-27 07:48:41,299 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-08-27 07:48:41,300 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-08-27 07:48:41,301 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-08-27 07:48:41,302 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-08-27 07:48:41,302 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-08-27 07:48:41,303 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-08-27 07:48:41,303 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-08-27 07:48:41,303 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-08-27 07:48:41,309 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-08-27 07:48:41,310 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-08-27 07:48:41,310 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2021-08-27 07:48:41,348 INFO L113 SettingsManager]: Loading preferences was successful [2021-08-27 07:48:41,349 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-08-27 07:48:41,350 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-08-27 07:48:41,350 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-08-27 07:48:41,351 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-08-27 07:48:41,352 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-08-27 07:48:41,352 INFO L138 SettingsManager]: * Use SBE=true [2021-08-27 07:48:41,352 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-08-27 07:48:41,352 INFO L138 SettingsManager]: * sizeof long=4 [2021-08-27 07:48:41,352 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2021-08-27 07:48:41,353 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-08-27 07:48:41,353 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-08-27 07:48:41,354 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-08-27 07:48:41,354 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2021-08-27 07:48:41,354 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2021-08-27 07:48:41,354 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2021-08-27 07:48:41,354 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-08-27 07:48:41,364 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2021-08-27 07:48:41,364 INFO L138 SettingsManager]: * sizeof long double=12 [2021-08-27 07:48:41,365 INFO L138 SettingsManager]: * Use constant arrays=true [2021-08-27 07:48:41,365 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-08-27 07:48:41,365 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-08-27 07:48:41,365 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-08-27 07:48:41,365 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-08-27 07:48:41,366 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-08-27 07:48:41,366 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-08-27 07:48:41,366 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-08-27 07:48:41,366 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-08-27 07:48:41,366 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-08-27 07:48:41,367 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:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux 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 -> 9caca1067e52a4490439beb955df6129aef4eea8 [2021-08-27 07:48:41,672 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-08-27 07:48:41,688 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-08-27 07:48:41,690 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-08-27 07:48:41,691 INFO L271 PluginConnector]: Initializing CDTParser... [2021-08-27 07:48:41,692 INFO L275 PluginConnector]: CDTParser initialized [2021-08-27 07:48:41,693 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ntdrivers-simplified/floppy_simpl3.cil-2.c [2021-08-27 07:48:41,749 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f0f884f28/1960a90fe30f4ebda7baf8d8eec69f83/FLAGcb917a7c4 [2021-08-27 07:48:42,261 INFO L306 CDTParser]: Found 1 translation units. [2021-08-27 07:48:42,262 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ntdrivers-simplified/floppy_simpl3.cil-2.c [2021-08-27 07:48:42,278 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f0f884f28/1960a90fe30f4ebda7baf8d8eec69f83/FLAGcb917a7c4 [2021-08-27 07:48:42,766 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f0f884f28/1960a90fe30f4ebda7baf8d8eec69f83 [2021-08-27 07:48:42,768 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-08-27 07:48:42,770 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2021-08-27 07:48:42,773 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-08-27 07:48:42,773 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-08-27 07:48:42,776 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-08-27 07:48:42,776 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.08 07:48:42" (1/1) ... [2021-08-27 07:48:42,777 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@45a08a1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 07:48:42, skipping insertion in model container [2021-08-27 07:48:42,777 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.08 07:48:42" (1/1) ... [2021-08-27 07:48:42,782 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-08-27 07:48:42,828 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-08-27 07:48:42,939 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ntdrivers-simplified/floppy_simpl3.cil-2.c[2713,2726] [2021-08-27 07:48:43,018 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-08-27 07:48:43,072 INFO L203 MainTranslator]: Completed pre-run [2021-08-27 07:48:43,084 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ntdrivers-simplified/floppy_simpl3.cil-2.c[2713,2726] [2021-08-27 07:48:43,156 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-08-27 07:48:43,182 INFO L208 MainTranslator]: Completed translation [2021-08-27 07:48:43,183 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 07:48:43 WrapperNode [2021-08-27 07:48:43,183 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-08-27 07:48:43,185 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-08-27 07:48:43,186 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-08-27 07:48:43,186 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-08-27 07:48:43,196 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 07:48:43" (1/1) ... [2021-08-27 07:48:43,196 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 07:48:43" (1/1) ... [2021-08-27 07:48:43,218 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 07:48:43" (1/1) ... [2021-08-27 07:48:43,228 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 07:48:43" (1/1) ... [2021-08-27 07:48:43,262 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 07:48:43" (1/1) ... [2021-08-27 07:48:43,269 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 07:48:43" (1/1) ... [2021-08-27 07:48:43,283 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 07:48:43" (1/1) ... [2021-08-27 07:48:43,288 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-08-27 07:48:43,295 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-08-27 07:48:43,296 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-08-27 07:48:43,296 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-08-27 07:48:43,297 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 07:48:43" (1/1) ... [2021-08-27 07:48:43,303 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-08-27 07:48:43,309 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 07:48:43,322 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-08-27 07:48:43,353 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-08-27 07:48:43,370 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2021-08-27 07:48:43,370 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-08-27 07:48:43,370 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2021-08-27 07:48:43,371 INFO L138 BoogieDeclarations]: Found implementation of procedure errorFn [2021-08-27 07:48:43,371 INFO L138 BoogieDeclarations]: Found implementation of procedure _BLAST_init [2021-08-27 07:48:43,372 INFO L138 BoogieDeclarations]: Found implementation of procedure FlAcpiConfigureFloppy [2021-08-27 07:48:43,372 INFO L138 BoogieDeclarations]: Found implementation of procedure FlQueueIrpToThread [2021-08-27 07:48:43,372 INFO L138 BoogieDeclarations]: Found implementation of procedure FloppyPnp [2021-08-27 07:48:43,372 INFO L138 BoogieDeclarations]: Found implementation of procedure FloppyStartDevice [2021-08-27 07:48:43,373 INFO L138 BoogieDeclarations]: Found implementation of procedure FloppyPnpComplete [2021-08-27 07:48:43,373 INFO L138 BoogieDeclarations]: Found implementation of procedure FlFdcDeviceIo [2021-08-27 07:48:43,373 INFO L138 BoogieDeclarations]: Found implementation of procedure FloppyProcessQueuedRequests [2021-08-27 07:48:43,373 INFO L138 BoogieDeclarations]: Found implementation of procedure stub_driver_init [2021-08-27 07:48:43,373 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2021-08-27 07:48:43,374 INFO L138 BoogieDeclarations]: Found implementation of procedure IoBuildDeviceIoControlRequest [2021-08-27 07:48:43,374 INFO L138 BoogieDeclarations]: Found implementation of procedure IoDeleteSymbolicLink [2021-08-27 07:48:43,374 INFO L138 BoogieDeclarations]: Found implementation of procedure IoQueryDeviceDescription [2021-08-27 07:48:43,374 INFO L138 BoogieDeclarations]: Found implementation of procedure IoRegisterDeviceInterface [2021-08-27 07:48:43,374 INFO L138 BoogieDeclarations]: Found implementation of procedure IoSetDeviceInterfaceState [2021-08-27 07:48:43,374 INFO L138 BoogieDeclarations]: Found implementation of procedure stubMoreProcessingRequired [2021-08-27 07:48:43,375 INFO L138 BoogieDeclarations]: Found implementation of procedure IofCallDriver [2021-08-27 07:48:43,375 INFO L138 BoogieDeclarations]: Found implementation of procedure IofCompleteRequest [2021-08-27 07:48:43,375 INFO L138 BoogieDeclarations]: Found implementation of procedure KeSetEvent [2021-08-27 07:48:43,375 INFO L138 BoogieDeclarations]: Found implementation of procedure KeWaitForSingleObject [2021-08-27 07:48:43,375 INFO L138 BoogieDeclarations]: Found implementation of procedure ObReferenceObjectByHandle [2021-08-27 07:48:43,375 INFO L138 BoogieDeclarations]: Found implementation of procedure PsCreateSystemThread [2021-08-27 07:48:43,376 INFO L138 BoogieDeclarations]: Found implementation of procedure ZwClose [2021-08-27 07:48:43,376 INFO L138 BoogieDeclarations]: Found implementation of procedure FloppyCreateClose [2021-08-27 07:48:43,376 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2021-08-27 07:48:43,376 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2021-08-27 07:48:43,376 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2021-08-27 07:48:43,377 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-08-27 07:48:43,377 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2021-08-27 07:48:43,377 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2021-08-27 07:48:43,377 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_long [2021-08-27 07:48:43,377 INFO L130 BoogieDeclarations]: Found specification of procedure FlAcpiConfigureFloppy [2021-08-27 07:48:43,377 INFO L130 BoogieDeclarations]: Found specification of procedure FlQueueIrpToThread [2021-08-27 07:48:43,378 INFO L130 BoogieDeclarations]: Found specification of procedure FloppyPnp [2021-08-27 07:48:43,378 INFO L130 BoogieDeclarations]: Found specification of procedure FloppyStartDevice [2021-08-27 07:48:43,378 INFO L130 BoogieDeclarations]: Found specification of procedure FloppyPnpComplete [2021-08-27 07:48:43,378 INFO L130 BoogieDeclarations]: Found specification of procedure FlFdcDeviceIo [2021-08-27 07:48:43,378 INFO L130 BoogieDeclarations]: Found specification of procedure IoBuildDeviceIoControlRequest [2021-08-27 07:48:43,378 INFO L130 BoogieDeclarations]: Found specification of procedure IoDeleteSymbolicLink [2021-08-27 07:48:43,379 INFO L130 BoogieDeclarations]: Found specification of procedure IoQueryDeviceDescription [2021-08-27 07:48:43,379 INFO L130 BoogieDeclarations]: Found specification of procedure IoRegisterDeviceInterface [2021-08-27 07:48:43,379 INFO L130 BoogieDeclarations]: Found specification of procedure IoSetDeviceInterfaceState [2021-08-27 07:48:43,379 INFO L130 BoogieDeclarations]: Found specification of procedure IofCallDriver [2021-08-27 07:48:43,380 INFO L130 BoogieDeclarations]: Found specification of procedure KeSetEvent [2021-08-27 07:48:43,380 INFO L130 BoogieDeclarations]: Found specification of procedure KeWaitForSingleObject [2021-08-27 07:48:43,380 INFO L130 BoogieDeclarations]: Found specification of procedure ObReferenceObjectByHandle [2021-08-27 07:48:43,380 INFO L130 BoogieDeclarations]: Found specification of procedure PsCreateSystemThread [2021-08-27 07:48:43,380 INFO L130 BoogieDeclarations]: Found specification of procedure ZwClose [2021-08-27 07:48:43,380 INFO L130 BoogieDeclarations]: Found specification of procedure IofCompleteRequest [2021-08-27 07:48:43,381 INFO L130 BoogieDeclarations]: Found specification of procedure errorFn [2021-08-27 07:48:43,381 INFO L130 BoogieDeclarations]: Found specification of procedure _BLAST_init [2021-08-27 07:48:43,381 INFO L130 BoogieDeclarations]: Found specification of procedure FloppyProcessQueuedRequests [2021-08-27 07:48:43,381 INFO L130 BoogieDeclarations]: Found specification of procedure stub_driver_init [2021-08-27 07:48:43,381 INFO L130 BoogieDeclarations]: Found specification of procedure main [2021-08-27 07:48:43,382 INFO L130 BoogieDeclarations]: Found specification of procedure stubMoreProcessingRequired [2021-08-27 07:48:43,382 INFO L130 BoogieDeclarations]: Found specification of procedure FloppyCreateClose [2021-08-27 07:48:43,382 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2021-08-27 07:48:43,382 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-08-27 07:48:43,382 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-08-27 07:48:43,383 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-08-27 07:48:43,383 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-08-27 07:48:43,383 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-08-27 07:48:43,779 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-08-27 07:48:43,822 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !false; [2021-08-27 07:48:43,823 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume false; [2021-08-27 07:48:43,845 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-08-27 07:48:43,857 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !false; [2021-08-27 07:48:43,857 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume false; [2021-08-27 07:48:43,867 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-08-27 07:48:44,057 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##21: assume !false; [2021-08-27 07:48:44,057 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##20: assume false; [2021-08-27 07:48:44,059 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-08-27 07:48:44,140 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##10: assume false; [2021-08-27 07:48:44,140 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##11: assume !false; [2021-08-27 07:48:44,155 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-08-27 07:48:44,176 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##16: assume !false; [2021-08-27 07:48:44,176 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##15: assume false; [2021-08-27 07:48:44,254 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-08-27 07:48:44,264 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !false; [2021-08-27 07:48:44,264 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume false; [2021-08-27 07:48:44,265 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-08-27 07:48:44,298 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !false; [2021-08-27 07:48:44,298 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume false; [2021-08-27 07:48:44,299 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-08-27 07:48:44,322 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !false; [2021-08-27 07:48:44,322 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume false; [2021-08-27 07:48:44,400 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-08-27 07:48:44,455 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##12: assume !false; [2021-08-27 07:48:44,455 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##11: assume false; [2021-08-27 07:48:44,517 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-08-27 07:48:44,538 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !false; [2021-08-27 07:48:44,538 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume false; [2021-08-27 07:48:44,538 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-08-27 07:48:44,547 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !false; [2021-08-27 07:48:44,548 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume false; [2021-08-27 07:48:44,548 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-08-27 07:48:44,555 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !false; [2021-08-27 07:48:44,555 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume false; [2021-08-27 07:48:44,571 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-08-27 07:48:44,572 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2021-08-27 07:48:44,574 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.08 07:48:44 BoogieIcfgContainer [2021-08-27 07:48:44,574 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-08-27 07:48:44,575 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-08-27 07:48:44,575 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-08-27 07:48:44,578 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-08-27 07:48:44,578 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.08 07:48:42" (1/3) ... [2021-08-27 07:48:44,579 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4e75c17 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.08 07:48:44, skipping insertion in model container [2021-08-27 07:48:44,579 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 07:48:43" (2/3) ... [2021-08-27 07:48:44,579 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4e75c17 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.08 07:48:44, skipping insertion in model container [2021-08-27 07:48:44,579 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.08 07:48:44" (3/3) ... [2021-08-27 07:48:44,581 INFO L111 eAbstractionObserver]: Analyzing ICFG floppy_simpl3.cil-2.c [2021-08-27 07:48:44,585 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-08-27 07:48:44,585 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2021-08-27 07:48:44,615 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-08-27 07:48:44,620 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-08-27 07:48:44,620 INFO L340 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2021-08-27 07:48:44,644 INFO L276 IsEmpty]: Start isEmpty. Operand has 305 states, 221 states have (on average 1.4253393665158371) internal successors, (315), 244 states have internal predecessors, (315), 56 states have call successors, (56), 24 states have call predecessors, (56), 24 states have return successors, (56), 51 states have call predecessors, (56), 56 states have call successors, (56) [2021-08-27 07:48:44,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2021-08-27 07:48:44,650 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 07:48:44,651 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 07:48:44,652 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting mainErr0ENSURES_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2021-08-27 07:48:44,656 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 07:48:44,657 INFO L82 PathProgramCache]: Analyzing trace with hash -2120787036, now seen corresponding path program 1 times [2021-08-27 07:48:44,664 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 07:48:44,664 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [385463720] [2021-08-27 07:48:44,665 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 07:48:44,666 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 07:48:44,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:48:45,106 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 07:48:45,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:48:45,207 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-08-27 07:48:45,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:48:45,228 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 07:48:45,233 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 07:48:45,234 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [385463720] [2021-08-27 07:48:45,235 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [385463720] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 07:48:45,235 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 07:48:45,235 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-27 07:48:45,237 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1013206567] [2021-08-27 07:48:45,246 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-27 07:48:45,252 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 07:48:45,261 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-27 07:48:45,262 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-08-27 07:48:45,270 INFO L87 Difference]: Start difference. First operand has 305 states, 221 states have (on average 1.4253393665158371) internal successors, (315), 244 states have internal predecessors, (315), 56 states have call successors, (56), 24 states have call predecessors, (56), 24 states have return successors, (56), 51 states have call predecessors, (56), 56 states have call successors, (56) 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-08-27 07:48:46,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 07:48:46,277 INFO L93 Difference]: Finished difference Result 329 states and 449 transitions. [2021-08-27 07:48:46,278 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-27 07:48:46,279 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-08-27 07:48:46,279 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 07:48:46,289 INFO L225 Difference]: With dead ends: 329 [2021-08-27 07:48:46,289 INFO L226 Difference]: Without dead ends: 322 [2021-08-27 07:48:46,291 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 254.1ms TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-08-27 07:48:46,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 322 states. [2021-08-27 07:48:46,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 322 to 292. [2021-08-27 07:48:46,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 292 states, 213 states have (on average 1.375586854460094) internal successors, (293), 233 states have internal predecessors, (293), 56 states have call successors, (56), 24 states have call predecessors, (56), 22 states have return successors, (37), 36 states have call predecessors, (37), 37 states have call successors, (37) [2021-08-27 07:48:46,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 292 states to 292 states and 386 transitions. [2021-08-27 07:48:46,341 INFO L78 Accepts]: Start accepts. Automaton has 292 states and 386 transitions. Word has length 15 [2021-08-27 07:48:46,341 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 07:48:46,342 INFO L470 AbstractCegarLoop]: Abstraction has 292 states and 386 transitions. [2021-08-27 07:48:46,342 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-08-27 07:48:46,342 INFO L276 IsEmpty]: Start isEmpty. Operand 292 states and 386 transitions. [2021-08-27 07:48:46,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-08-27 07:48:46,343 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 07:48:46,343 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-08-27 07:48:46,343 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-08-27 07:48:46,344 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2021-08-27 07:48:46,344 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 07:48:46,344 INFO L82 PathProgramCache]: Analyzing trace with hash 1263023814, now seen corresponding path program 1 times [2021-08-27 07:48:46,344 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 07:48:46,345 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [284831129] [2021-08-27 07:48:46,345 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 07:48:46,345 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 07:48:46,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:48:46,521 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 07:48:46,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:48:46,570 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-08-27 07:48:46,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:48:46,586 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 07:48:46,587 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 07:48:46,587 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [284831129] [2021-08-27 07:48:46,587 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [284831129] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 07:48:46,587 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 07:48:46,587 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-08-27 07:48:46,588 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [513873420] [2021-08-27 07:48:46,589 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-08-27 07:48:46,589 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 07:48:46,591 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-08-27 07:48:46,591 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-08-27 07:48:46,591 INFO L87 Difference]: Start difference. First operand 292 states and 386 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-08-27 07:48:47,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 07:48:47,466 INFO L93 Difference]: Finished difference Result 322 states and 432 transitions. [2021-08-27 07:48:47,469 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-08-27 07:48:47,469 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-08-27 07:48:47,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 07:48:47,472 INFO L225 Difference]: With dead ends: 322 [2021-08-27 07:48:47,472 INFO L226 Difference]: Without dead ends: 322 [2021-08-27 07:48:47,473 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 148.2ms TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-08-27 07:48:47,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 322 states. [2021-08-27 07:48:47,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 322 to 292. [2021-08-27 07:48:47,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 292 states, 213 states have (on average 1.3708920187793427) internal successors, (292), 233 states have internal predecessors, (292), 56 states have call successors, (56), 24 states have call predecessors, (56), 22 states have return successors, (37), 36 states have call predecessors, (37), 37 states have call successors, (37) [2021-08-27 07:48:47,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 292 states to 292 states and 385 transitions. [2021-08-27 07:48:47,492 INFO L78 Accepts]: Start accepts. Automaton has 292 states and 385 transitions. Word has length 20 [2021-08-27 07:48:47,492 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 07:48:47,492 INFO L470 AbstractCegarLoop]: Abstraction has 292 states and 385 transitions. [2021-08-27 07:48:47,493 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-08-27 07:48:47,493 INFO L276 IsEmpty]: Start isEmpty. Operand 292 states and 385 transitions. [2021-08-27 07:48:47,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2021-08-27 07:48:47,493 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 07:48:47,494 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] [2021-08-27 07:48:47,494 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-08-27 07:48:47,494 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2021-08-27 07:48:47,495 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 07:48:47,495 INFO L82 PathProgramCache]: Analyzing trace with hash 1377431699, now seen corresponding path program 1 times [2021-08-27 07:48:47,495 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 07:48:47,495 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [754293439] [2021-08-27 07:48:47,495 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 07:48:47,496 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 07:48:47,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:48:47,665 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 07:48:47,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:48:47,700 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-08-27 07:48:47,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:48:47,723 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-08-27 07:48:47,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:48:47,732 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 07:48:47,733 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 07:48:47,733 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [754293439] [2021-08-27 07:48:47,733 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [754293439] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 07:48:47,733 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 07:48:47,734 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-08-27 07:48:47,734 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [794983225] [2021-08-27 07:48:47,734 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-08-27 07:48:47,734 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 07:48:47,735 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-08-27 07:48:47,735 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2021-08-27 07:48:47,735 INFO L87 Difference]: Start difference. First operand 292 states and 385 transitions. Second operand has 6 states, 6 states have (on average 3.0) internal successors, (18), 3 states have internal predecessors, (18), 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-08-27 07:48:49,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 07:48:49,592 INFO L93 Difference]: Finished difference Result 477 states and 636 transitions. [2021-08-27 07:48:49,592 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-08-27 07:48:49,593 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 3 states have internal predecessors, (18), 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 28 [2021-08-27 07:48:49,593 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 07:48:49,596 INFO L225 Difference]: With dead ends: 477 [2021-08-27 07:48:49,596 INFO L226 Difference]: Without dead ends: 476 [2021-08-27 07:48:49,596 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 272.8ms TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2021-08-27 07:48:49,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 476 states. [2021-08-27 07:48:49,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 476 to 429. [2021-08-27 07:48:49,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 429 states, 328 states have (on average 1.3140243902439024) internal successors, (431), 334 states have internal predecessors, (431), 65 states have call successors, (65), 37 states have call predecessors, (65), 35 states have return successors, (74), 59 states have call predecessors, (74), 54 states have call successors, (74) [2021-08-27 07:48:49,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 429 states to 429 states and 570 transitions. [2021-08-27 07:48:49,623 INFO L78 Accepts]: Start accepts. Automaton has 429 states and 570 transitions. Word has length 28 [2021-08-27 07:48:49,624 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 07:48:49,624 INFO L470 AbstractCegarLoop]: Abstraction has 429 states and 570 transitions. [2021-08-27 07:48:49,624 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 3 states have internal predecessors, (18), 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-08-27 07:48:49,624 INFO L276 IsEmpty]: Start isEmpty. Operand 429 states and 570 transitions. [2021-08-27 07:48:49,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2021-08-27 07:48:49,625 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 07:48:49,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] [2021-08-27 07:48:49,625 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-08-27 07:48:49,626 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2021-08-27 07:48:49,626 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 07:48:49,626 INFO L82 PathProgramCache]: Analyzing trace with hash 1586729981, now seen corresponding path program 1 times [2021-08-27 07:48:49,626 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 07:48:49,627 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [175324431] [2021-08-27 07:48:49,627 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 07:48:49,627 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 07:48:49,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:48:49,795 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 07:48:49,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:48:49,855 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-08-27 07:48:49,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:48:49,877 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-08-27 07:48:49,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:48:49,885 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 07:48:49,886 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 07:48:49,886 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [175324431] [2021-08-27 07:48:49,886 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [175324431] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 07:48:49,886 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 07:48:49,886 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-08-27 07:48:49,886 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1365493362] [2021-08-27 07:48:49,887 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-08-27 07:48:49,887 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 07:48:49,888 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-08-27 07:48:49,888 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2021-08-27 07:48:49,888 INFO L87 Difference]: Start difference. First operand 429 states and 570 transitions. Second operand has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 3 states have internal predecessors, (20), 3 states have call successors, (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-08-27 07:48:50,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 07:48:50,734 INFO L93 Difference]: Finished difference Result 675 states and 900 transitions. [2021-08-27 07:48:50,735 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-08-27 07:48:50,735 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 3 states have internal predecessors, (20), 3 states have call successors, (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 30 [2021-08-27 07:48:50,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 07:48:50,738 INFO L225 Difference]: With dead ends: 675 [2021-08-27 07:48:50,738 INFO L226 Difference]: Without dead ends: 675 [2021-08-27 07:48:50,739 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 247.1ms TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2021-08-27 07:48:50,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 675 states. [2021-08-27 07:48:50,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 675 to 632. [2021-08-27 07:48:50,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 632 states, 493 states have (on average 1.3144016227180528) internal successors, (648), 497 states have internal predecessors, (648), 85 states have call successors, (85), 55 states have call predecessors, (85), 53 states have return successors, (112), 81 states have call predecessors, (112), 76 states have call successors, (112) [2021-08-27 07:48:50,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 632 states to 632 states and 845 transitions. [2021-08-27 07:48:50,787 INFO L78 Accepts]: Start accepts. Automaton has 632 states and 845 transitions. Word has length 30 [2021-08-27 07:48:50,788 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 07:48:50,788 INFO L470 AbstractCegarLoop]: Abstraction has 632 states and 845 transitions. [2021-08-27 07:48:50,788 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 3 states have internal predecessors, (20), 3 states have call successors, (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-08-27 07:48:50,788 INFO L276 IsEmpty]: Start isEmpty. Operand 632 states and 845 transitions. [2021-08-27 07:48:50,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2021-08-27 07:48:50,791 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 07:48:50,792 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] [2021-08-27 07:48:50,792 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-08-27 07:48:50,792 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2021-08-27 07:48:50,792 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 07:48:50,793 INFO L82 PathProgramCache]: Analyzing trace with hash -962074547, now seen corresponding path program 1 times [2021-08-27 07:48:50,793 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 07:48:50,793 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [648147217] [2021-08-27 07:48:50,793 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 07:48:50,794 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 07:48:50,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:48:50,954 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 07:48:50,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:48:50,990 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-08-27 07:48:50,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:48:51,011 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-08-27 07:48:51,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:48:51,027 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 07:48:51,027 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 07:48:51,027 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [648147217] [2021-08-27 07:48:51,027 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [648147217] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 07:48:51,028 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 07:48:51,028 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-08-27 07:48:51,028 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1782433667] [2021-08-27 07:48:51,028 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-08-27 07:48:51,028 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 07:48:51,030 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-08-27 07:48:51,030 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2021-08-27 07:48:51,030 INFO L87 Difference]: Start difference. First operand 632 states and 845 transitions. Second operand has 6 states, 6 states have (on average 4.0) internal successors, (24), 3 states have internal predecessors, (24), 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-08-27 07:48:51,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 07:48:51,977 INFO L93 Difference]: Finished difference Result 721 states and 953 transitions. [2021-08-27 07:48:51,980 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-08-27 07:48:51,980 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.0) internal successors, (24), 3 states have internal predecessors, (24), 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 34 [2021-08-27 07:48:51,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 07:48:51,984 INFO L225 Difference]: With dead ends: 721 [2021-08-27 07:48:51,984 INFO L226 Difference]: Without dead ends: 721 [2021-08-27 07:48:51,984 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 249.5ms TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2021-08-27 07:48:51,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 721 states. [2021-08-27 07:48:52,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 721 to 670. [2021-08-27 07:48:52,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 670 states, 525 states have (on average 1.3161904761904761) internal successors, (691), 535 states have internal predecessors, (691), 86 states have call successors, (86), 57 states have call predecessors, (86), 58 states have return successors, (117), 80 states have call predecessors, (117), 78 states have call successors, (117) [2021-08-27 07:48:52,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 670 states to 670 states and 894 transitions. [2021-08-27 07:48:52,006 INFO L78 Accepts]: Start accepts. Automaton has 670 states and 894 transitions. Word has length 34 [2021-08-27 07:48:52,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 07:48:52,006 INFO L470 AbstractCegarLoop]: Abstraction has 670 states and 894 transitions. [2021-08-27 07:48:52,006 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.0) internal successors, (24), 3 states have internal predecessors, (24), 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-08-27 07:48:52,007 INFO L276 IsEmpty]: Start isEmpty. Operand 670 states and 894 transitions. [2021-08-27 07:48:52,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2021-08-27 07:48:52,008 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 07:48:52,008 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-08-27 07:48:52,009 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-08-27 07:48:52,009 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2021-08-27 07:48:52,009 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 07:48:52,009 INFO L82 PathProgramCache]: Analyzing trace with hash 82742685, now seen corresponding path program 1 times [2021-08-27 07:48:52,010 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 07:48:52,010 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [150235397] [2021-08-27 07:48:52,010 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 07:48:52,010 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 07:48:52,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:48:52,149 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 07:48:52,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:48:52,182 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-08-27 07:48:52,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:48:52,201 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-08-27 07:48:52,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:48:52,215 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2021-08-27 07:48:52,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:48:52,232 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 07:48:52,232 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 07:48:52,233 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [150235397] [2021-08-27 07:48:52,233 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [150235397] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 07:48:52,233 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 07:48:52,233 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-08-27 07:48:52,233 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1842009220] [2021-08-27 07:48:52,234 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-08-27 07:48:52,234 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 07:48:52,234 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-08-27 07:48:52,235 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2021-08-27 07:48:52,235 INFO L87 Difference]: Start difference. First operand 670 states and 894 transitions. Second operand has 9 states, 9 states have (on average 3.2222222222222223) internal successors, (29), 4 states have internal predecessors, (29), 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-08-27 07:48:53,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 07:48:53,602 INFO L93 Difference]: Finished difference Result 696 states and 924 transitions. [2021-08-27 07:48:53,609 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-08-27 07:48:53,610 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.2222222222222223) internal successors, (29), 4 states have internal predecessors, (29), 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 41 [2021-08-27 07:48:53,611 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 07:48:53,615 INFO L225 Difference]: With dead ends: 696 [2021-08-27 07:48:53,615 INFO L226 Difference]: Without dead ends: 696 [2021-08-27 07:48:53,616 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 224.8ms TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2021-08-27 07:48:53,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 696 states. [2021-08-27 07:48:53,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 696 to 674. [2021-08-27 07:48:53,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 674 states, 528 states have (on average 1.3143939393939394) internal successors, (694), 538 states have internal predecessors, (694), 86 states have call successors, (86), 57 states have call predecessors, (86), 59 states have return successors, (118), 81 states have call predecessors, (118), 78 states have call successors, (118) [2021-08-27 07:48:53,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 674 states to 674 states and 898 transitions. [2021-08-27 07:48:53,645 INFO L78 Accepts]: Start accepts. Automaton has 674 states and 898 transitions. Word has length 41 [2021-08-27 07:48:53,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 07:48:53,646 INFO L470 AbstractCegarLoop]: Abstraction has 674 states and 898 transitions. [2021-08-27 07:48:53,647 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.2222222222222223) internal successors, (29), 4 states have internal predecessors, (29), 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-08-27 07:48:53,647 INFO L276 IsEmpty]: Start isEmpty. Operand 674 states and 898 transitions. [2021-08-27 07:48:53,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2021-08-27 07:48:53,651 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 07:48:53,651 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-08-27 07:48:53,651 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-08-27 07:48:53,651 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2021-08-27 07:48:53,652 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 07:48:53,652 INFO L82 PathProgramCache]: Analyzing trace with hash -127535261, now seen corresponding path program 1 times [2021-08-27 07:48:53,652 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 07:48:53,655 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1196683351] [2021-08-27 07:48:53,655 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 07:48:53,655 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 07:48:53,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:48:53,810 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 07:48:53,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:48:53,843 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-08-27 07:48:53,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:48:53,860 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-08-27 07:48:53,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:48:53,865 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 07:48:53,866 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 07:48:53,866 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1196683351] [2021-08-27 07:48:53,866 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1196683351] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 07:48:53,866 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 07:48:53,866 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-08-27 07:48:53,866 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1967694973] [2021-08-27 07:48:53,867 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-08-27 07:48:53,867 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 07:48:53,867 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-08-27 07:48:53,868 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2021-08-27 07:48:53,868 INFO L87 Difference]: Start difference. First operand 674 states and 898 transitions. Second operand has 6 states, 6 states have (on average 5.0) internal successors, (30), 3 states have internal predecessors, (30), 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-08-27 07:48:54,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 07:48:54,630 INFO L93 Difference]: Finished difference Result 698 states and 928 transitions. [2021-08-27 07:48:54,631 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-08-27 07:48:54,631 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.0) internal successors, (30), 3 states have internal predecessors, (30), 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 40 [2021-08-27 07:48:54,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 07:48:54,634 INFO L225 Difference]: With dead ends: 698 [2021-08-27 07:48:54,635 INFO L226 Difference]: Without dead ends: 698 [2021-08-27 07:48:54,635 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 211.1ms TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2021-08-27 07:48:54,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 698 states. [2021-08-27 07:48:54,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 698 to 685. [2021-08-27 07:48:54,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 685 states, 539 states have (on average 1.313543599257885) internal successors, (708), 548 states have internal predecessors, (708), 86 states have call successors, (86), 58 states have call predecessors, (86), 59 states have return successors, (118), 81 states have call predecessors, (118), 78 states have call successors, (118) [2021-08-27 07:48:54,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 685 states to 685 states and 912 transitions. [2021-08-27 07:48:54,652 INFO L78 Accepts]: Start accepts. Automaton has 685 states and 912 transitions. Word has length 40 [2021-08-27 07:48:54,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 07:48:54,653 INFO L470 AbstractCegarLoop]: Abstraction has 685 states and 912 transitions. [2021-08-27 07:48:54,653 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.0) internal successors, (30), 3 states have internal predecessors, (30), 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-08-27 07:48:54,653 INFO L276 IsEmpty]: Start isEmpty. Operand 685 states and 912 transitions. [2021-08-27 07:48:54,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2021-08-27 07:48:54,654 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 07:48:54,654 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-08-27 07:48:54,654 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-08-27 07:48:54,655 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2021-08-27 07:48:54,655 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 07:48:54,655 INFO L82 PathProgramCache]: Analyzing trace with hash -1411662583, now seen corresponding path program 1 times [2021-08-27 07:48:54,655 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 07:48:54,655 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [301788270] [2021-08-27 07:48:54,656 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 07:48:54,656 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 07:48:54,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:48:54,806 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 07:48:54,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:48:54,844 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-08-27 07:48:54,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:48:54,867 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-08-27 07:48:54,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:48:54,889 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-08-27 07:48:54,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:48:54,911 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-08-27 07:48:54,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:48:54,920 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 07:48:54,920 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 07:48:54,920 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [301788270] [2021-08-27 07:48:54,920 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [301788270] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 07:48:54,921 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 07:48:54,921 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-08-27 07:48:54,921 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [966204421] [2021-08-27 07:48:54,921 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-08-27 07:48:54,921 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 07:48:54,922 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-08-27 07:48:54,922 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2021-08-27 07:48:54,923 INFO L87 Difference]: Start difference. First operand 685 states and 912 transitions. Second operand has 8 states, 8 states have (on average 3.625) internal successors, (29), 3 states have internal predecessors, (29), 2 states have call successors, (7), 7 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 1 states have call successors, (5) [2021-08-27 07:48:56,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 07:48:56,167 INFO L93 Difference]: Finished difference Result 747 states and 988 transitions. [2021-08-27 07:48:56,167 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-08-27 07:48:56,168 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.625) internal successors, (29), 3 states have internal predecessors, (29), 2 states have call successors, (7), 7 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 1 states have call successors, (5) Word has length 41 [2021-08-27 07:48:56,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 07:48:56,171 INFO L225 Difference]: With dead ends: 747 [2021-08-27 07:48:56,171 INFO L226 Difference]: Without dead ends: 747 [2021-08-27 07:48:56,171 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 254.9ms TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2021-08-27 07:48:56,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 747 states. [2021-08-27 07:48:56,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 747 to 718. [2021-08-27 07:48:56,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 718 states, 566 states have (on average 1.3091872791519434) internal successors, (741), 578 states have internal predecessors, (741), 86 states have call successors, (86), 58 states have call predecessors, (86), 65 states have return successors, (124), 83 states have call predecessors, (124), 78 states have call successors, (124) [2021-08-27 07:48:56,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 718 states to 718 states and 951 transitions. [2021-08-27 07:48:56,189 INFO L78 Accepts]: Start accepts. Automaton has 718 states and 951 transitions. Word has length 41 [2021-08-27 07:48:56,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 07:48:56,190 INFO L470 AbstractCegarLoop]: Abstraction has 718 states and 951 transitions. [2021-08-27 07:48:56,190 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.625) internal successors, (29), 3 states have internal predecessors, (29), 2 states have call successors, (7), 7 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 1 states have call successors, (5) [2021-08-27 07:48:56,190 INFO L276 IsEmpty]: Start isEmpty. Operand 718 states and 951 transitions. [2021-08-27 07:48:56,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2021-08-27 07:48:56,191 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 07:48:56,191 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-08-27 07:48:56,192 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-08-27 07:48:56,192 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2021-08-27 07:48:56,192 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 07:48:56,192 INFO L82 PathProgramCache]: Analyzing trace with hash -359990476, now seen corresponding path program 1 times [2021-08-27 07:48:56,192 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 07:48:56,193 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1558482110] [2021-08-27 07:48:56,193 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 07:48:56,193 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 07:48:56,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:48:56,345 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 07:48:56,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:48:56,379 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-08-27 07:48:56,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:48:56,412 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-08-27 07:48:56,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:48:56,436 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-08-27 07:48:56,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:48:56,486 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-08-27 07:48:56,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:48:56,506 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 07:48:56,507 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 07:48:56,507 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1558482110] [2021-08-27 07:48:56,507 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1558482110] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 07:48:56,507 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 07:48:56,507 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-08-27 07:48:56,507 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [273863285] [2021-08-27 07:48:56,509 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-08-27 07:48:56,509 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 07:48:56,509 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-08-27 07:48:56,513 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2021-08-27 07:48:56,513 INFO L87 Difference]: Start difference. First operand 718 states and 951 transitions. Second operand has 12 states, 12 states have (on average 2.5) internal successors, (30), 7 states have internal predecessors, (30), 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-08-27 07:48:58,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 07:48:58,119 INFO L93 Difference]: Finished difference Result 747 states and 987 transitions. [2021-08-27 07:48:58,119 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-08-27 07:48:58,119 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.5) internal successors, (30), 7 states have internal predecessors, (30), 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 42 [2021-08-27 07:48:58,119 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 07:48:58,123 INFO L225 Difference]: With dead ends: 747 [2021-08-27 07:48:58,123 INFO L226 Difference]: Without dead ends: 747 [2021-08-27 07:48:58,123 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 645.7ms TimeCoverageRelationStatistics Valid=90, Invalid=216, Unknown=0, NotChecked=0, Total=306 [2021-08-27 07:48:58,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 747 states. [2021-08-27 07:48:58,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 747 to 718. [2021-08-27 07:48:58,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 718 states, 566 states have (on average 1.3074204946996466) internal successors, (740), 578 states have internal predecessors, (740), 86 states have call successors, (86), 58 states have call predecessors, (86), 65 states have return successors, (124), 83 states have call predecessors, (124), 78 states have call successors, (124) [2021-08-27 07:48:58,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 718 states to 718 states and 950 transitions. [2021-08-27 07:48:58,140 INFO L78 Accepts]: Start accepts. Automaton has 718 states and 950 transitions. Word has length 42 [2021-08-27 07:48:58,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 07:48:58,141 INFO L470 AbstractCegarLoop]: Abstraction has 718 states and 950 transitions. [2021-08-27 07:48:58,141 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.5) internal successors, (30), 7 states have internal predecessors, (30), 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-08-27 07:48:58,141 INFO L276 IsEmpty]: Start isEmpty. Operand 718 states and 950 transitions. [2021-08-27 07:48:58,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2021-08-27 07:48:58,142 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 07:48:58,142 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-08-27 07:48:58,143 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-08-27 07:48:58,143 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2021-08-27 07:48:58,143 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 07:48:58,143 INFO L82 PathProgramCache]: Analyzing trace with hash 864804566, now seen corresponding path program 1 times [2021-08-27 07:48:58,144 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 07:48:58,144 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [801334348] [2021-08-27 07:48:58,144 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 07:48:58,144 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 07:48:58,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:48:58,280 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 07:48:58,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:48:58,314 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-08-27 07:48:58,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:48:58,350 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-08-27 07:48:58,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:48:58,376 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-08-27 07:48:58,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:48:58,438 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-08-27 07:48:58,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:48:58,468 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 07:48:58,468 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 07:48:58,468 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [801334348] [2021-08-27 07:48:58,469 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [801334348] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 07:48:58,469 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 07:48:58,469 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-08-27 07:48:58,469 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [646008894] [2021-08-27 07:48:58,469 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-08-27 07:48:58,470 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 07:48:58,470 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-08-27 07:48:58,470 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2021-08-27 07:48:58,470 INFO L87 Difference]: Start difference. First operand 718 states and 950 transitions. Second operand has 12 states, 12 states have (on average 2.5833333333333335) internal successors, (31), 7 states have internal predecessors, (31), 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-08-27 07:48:59,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 07:48:59,814 INFO L93 Difference]: Finished difference Result 747 states and 986 transitions. [2021-08-27 07:48:59,815 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-08-27 07:48:59,815 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.5833333333333335) internal successors, (31), 7 states have internal predecessors, (31), 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 43 [2021-08-27 07:48:59,815 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 07:48:59,818 INFO L225 Difference]: With dead ends: 747 [2021-08-27 07:48:59,818 INFO L226 Difference]: Without dead ends: 747 [2021-08-27 07:48:59,819 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 656.6ms TimeCoverageRelationStatistics Valid=90, Invalid=216, Unknown=0, NotChecked=0, Total=306 [2021-08-27 07:48:59,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 747 states. [2021-08-27 07:48:59,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 747 to 718. [2021-08-27 07:48:59,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 718 states, 566 states have (on average 1.3056537102473498) internal successors, (739), 578 states have internal predecessors, (739), 86 states have call successors, (86), 58 states have call predecessors, (86), 65 states have return successors, (124), 83 states have call predecessors, (124), 78 states have call successors, (124) [2021-08-27 07:48:59,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 718 states to 718 states and 949 transitions. [2021-08-27 07:48:59,836 INFO L78 Accepts]: Start accepts. Automaton has 718 states and 949 transitions. Word has length 43 [2021-08-27 07:48:59,836 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 07:48:59,837 INFO L470 AbstractCegarLoop]: Abstraction has 718 states and 949 transitions. [2021-08-27 07:48:59,837 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.5833333333333335) internal successors, (31), 7 states have internal predecessors, (31), 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-08-27 07:48:59,837 INFO L276 IsEmpty]: Start isEmpty. Operand 718 states and 949 transitions. [2021-08-27 07:48:59,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2021-08-27 07:48:59,838 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 07:48:59,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] [2021-08-27 07:48:59,839 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-08-27 07:48:59,839 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2021-08-27 07:48:59,839 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 07:48:59,840 INFO L82 PathProgramCache]: Analyzing trace with hash 484799798, now seen corresponding path program 1 times [2021-08-27 07:48:59,840 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 07:48:59,841 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [571557662] [2021-08-27 07:48:59,841 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 07:48:59,842 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 07:48:59,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:48:59,963 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 07:48:59,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:48:59,997 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-08-27 07:48:59,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:00,015 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-08-27 07:49:00,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:00,027 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2021-08-27 07:49:00,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:00,032 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 07:49:00,033 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 07:49:00,033 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [571557662] [2021-08-27 07:49:00,033 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [571557662] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 07:49:00,033 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 07:49:00,033 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-08-27 07:49:00,034 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [658311401] [2021-08-27 07:49:00,034 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-08-27 07:49:00,034 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 07:49:00,034 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-08-27 07:49:00,035 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2021-08-27 07:49:00,035 INFO L87 Difference]: Start difference. First operand 718 states and 949 transitions. Second operand has 7 states, 7 states have (on average 4.571428571428571) internal successors, (32), 3 states have internal predecessors, (32), 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-08-27 07:49:01,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 07:49:01,482 INFO L93 Difference]: Finished difference Result 1090 states and 1456 transitions. [2021-08-27 07:49:01,483 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-08-27 07:49:01,483 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.571428571428571) internal successors, (32), 3 states have internal predecessors, (32), 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 44 [2021-08-27 07:49:01,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 07:49:01,493 INFO L225 Difference]: With dead ends: 1090 [2021-08-27 07:49:01,493 INFO L226 Difference]: Without dead ends: 1090 [2021-08-27 07:49:01,494 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 246.5ms TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2021-08-27 07:49:01,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1090 states. [2021-08-27 07:49:01,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1090 to 831. [2021-08-27 07:49:01,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 831 states, 657 states have (on average 1.3135464231354643) internal successors, (863), 671 states have internal predecessors, (863), 96 states have call successors, (96), 68 states have call predecessors, (96), 77 states have return successors, (144), 93 states have call predecessors, (144), 88 states have call successors, (144) [2021-08-27 07:49:01,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 831 states to 831 states and 1103 transitions. [2021-08-27 07:49:01,522 INFO L78 Accepts]: Start accepts. Automaton has 831 states and 1103 transitions. Word has length 44 [2021-08-27 07:49:01,522 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 07:49:01,522 INFO L470 AbstractCegarLoop]: Abstraction has 831 states and 1103 transitions. [2021-08-27 07:49:01,523 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.571428571428571) internal successors, (32), 3 states have internal predecessors, (32), 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-08-27 07:49:01,523 INFO L276 IsEmpty]: Start isEmpty. Operand 831 states and 1103 transitions. [2021-08-27 07:49:01,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2021-08-27 07:49:01,524 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 07:49:01,524 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-08-27 07:49:01,524 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-08-27 07:49:01,524 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2021-08-27 07:49:01,525 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 07:49:01,525 INFO L82 PathProgramCache]: Analyzing trace with hash 1122912541, now seen corresponding path program 1 times [2021-08-27 07:49:01,525 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 07:49:01,525 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [677142428] [2021-08-27 07:49:01,525 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 07:49:01,526 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 07:49:01,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:01,662 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 07:49:01,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:01,710 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-08-27 07:49:01,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:01,729 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-08-27 07:49:01,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:01,750 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-08-27 07:49:01,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:01,780 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-08-27 07:49:01,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:01,784 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 07:49:01,784 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 07:49:01,784 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [677142428] [2021-08-27 07:49:01,785 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [677142428] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 07:49:01,785 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 07:49:01,785 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-08-27 07:49:01,785 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [559639513] [2021-08-27 07:49:01,785 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-08-27 07:49:01,785 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 07:49:01,786 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-08-27 07:49:01,786 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2021-08-27 07:49:01,786 INFO L87 Difference]: Start difference. First operand 831 states and 1103 transitions. Second operand has 10 states, 10 states have (on average 3.2) internal successors, (32), 4 states have internal predecessors, (32), 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-08-27 07:49:03,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 07:49:03,048 INFO L93 Difference]: Finished difference Result 871 states and 1151 transitions. [2021-08-27 07:49:03,048 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-08-27 07:49:03,048 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.2) internal successors, (32), 4 states have internal predecessors, (32), 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 44 [2021-08-27 07:49:03,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 07:49:03,052 INFO L225 Difference]: With dead ends: 871 [2021-08-27 07:49:03,052 INFO L226 Difference]: Without dead ends: 856 [2021-08-27 07:49:03,052 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 176.9ms TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2021-08-27 07:49:03,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 856 states. [2021-08-27 07:49:03,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 856 to 829. [2021-08-27 07:49:03,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 829 states, 656 states have (on average 1.3125) internal successors, (861), 670 states have internal predecessors, (861), 95 states have call successors, (95), 68 states have call predecessors, (95), 77 states have return successors, (143), 92 states have call predecessors, (143), 87 states have call successors, (143) [2021-08-27 07:49:03,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 829 states to 829 states and 1099 transitions. [2021-08-27 07:49:03,073 INFO L78 Accepts]: Start accepts. Automaton has 829 states and 1099 transitions. Word has length 44 [2021-08-27 07:49:03,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 07:49:03,073 INFO L470 AbstractCegarLoop]: Abstraction has 829 states and 1099 transitions. [2021-08-27 07:49:03,073 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.2) internal successors, (32), 4 states have internal predecessors, (32), 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-08-27 07:49:03,074 INFO L276 IsEmpty]: Start isEmpty. Operand 829 states and 1099 transitions. [2021-08-27 07:49:03,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2021-08-27 07:49:03,074 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 07:49:03,075 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-08-27 07:49:03,075 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-08-27 07:49:03,075 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2021-08-27 07:49:03,075 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 07:49:03,075 INFO L82 PathProgramCache]: Analyzing trace with hash 1906062941, now seen corresponding path program 1 times [2021-08-27 07:49:03,076 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 07:49:03,076 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [469292260] [2021-08-27 07:49:03,076 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 07:49:03,076 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 07:49:03,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:03,234 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 07:49:03,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:03,268 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-08-27 07:49:03,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:03,307 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-08-27 07:49:03,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:03,351 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2021-08-27 07:49:03,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:03,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-08-27 07:49:03,358 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 07:49:03,358 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [469292260] [2021-08-27 07:49:03,359 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [469292260] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 07:49:03,359 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 07:49:03,359 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-08-27 07:49:03,359 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [885350804] [2021-08-27 07:49:03,360 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-08-27 07:49:03,360 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 07:49:03,360 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-08-27 07:49:03,361 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2021-08-27 07:49:03,361 INFO L87 Difference]: Start difference. First operand 829 states and 1099 transitions. Second operand has 10 states, 10 states have (on average 3.3) internal successors, (33), 6 states have internal predecessors, (33), 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-08-27 07:49:04,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 07:49:04,903 INFO L93 Difference]: Finished difference Result 874 states and 1141 transitions. [2021-08-27 07:49:04,903 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-08-27 07:49:04,904 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.3) internal successors, (33), 6 states have internal predecessors, (33), 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 45 [2021-08-27 07:49:04,904 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 07:49:04,907 INFO L225 Difference]: With dead ends: 874 [2021-08-27 07:49:04,907 INFO L226 Difference]: Without dead ends: 874 [2021-08-27 07:49:04,908 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 650.6ms TimeCoverageRelationStatistics Valid=84, Invalid=188, Unknown=0, NotChecked=0, Total=272 [2021-08-27 07:49:04,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 874 states. [2021-08-27 07:49:04,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 874 to 820. [2021-08-27 07:49:04,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 820 states, 647 states have (on average 1.2982998454404946) internal successors, (840), 661 states have internal predecessors, (840), 95 states have call successors, (95), 68 states have call predecessors, (95), 77 states have return successors, (143), 92 states have call predecessors, (143), 87 states have call successors, (143) [2021-08-27 07:49:04,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 820 states to 820 states and 1078 transitions. [2021-08-27 07:49:04,926 INFO L78 Accepts]: Start accepts. Automaton has 820 states and 1078 transitions. Word has length 45 [2021-08-27 07:49:04,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 07:49:04,927 INFO L470 AbstractCegarLoop]: Abstraction has 820 states and 1078 transitions. [2021-08-27 07:49:04,928 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.3) internal successors, (33), 6 states have internal predecessors, (33), 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-08-27 07:49:04,928 INFO L276 IsEmpty]: Start isEmpty. Operand 820 states and 1078 transitions. [2021-08-27 07:49:04,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2021-08-27 07:49:04,930 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 07:49:04,930 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 07:49:04,931 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-08-27 07:49:04,931 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2021-08-27 07:49:04,931 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 07:49:04,931 INFO L82 PathProgramCache]: Analyzing trace with hash 1924856002, now seen corresponding path program 1 times [2021-08-27 07:49:04,931 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 07:49:04,932 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [869886076] [2021-08-27 07:49:04,932 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 07:49:04,932 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 07:49:04,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:05,049 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 07:49:05,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:05,079 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-08-27 07:49:05,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:05,097 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-08-27 07:49:05,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:05,111 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2021-08-27 07:49:05,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:05,124 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 07:49:05,124 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 07:49:05,125 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [869886076] [2021-08-27 07:49:05,125 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [869886076] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 07:49:05,125 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 07:49:05,125 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-08-27 07:49:05,125 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1648619056] [2021-08-27 07:49:05,125 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-08-27 07:49:05,126 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 07:49:05,126 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-08-27 07:49:05,126 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2021-08-27 07:49:05,126 INFO L87 Difference]: Start difference. First operand 820 states and 1078 transitions. Second operand has 8 states, 8 states have (on average 4.5) internal successors, (36), 4 states have internal predecessors, (36), 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-08-27 07:49:06,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 07:49:06,516 INFO L93 Difference]: Finished difference Result 580 states and 730 transitions. [2021-08-27 07:49:06,516 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-08-27 07:49:06,525 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.5) internal successors, (36), 4 states have internal predecessors, (36), 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 49 [2021-08-27 07:49:06,525 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 07:49:06,527 INFO L225 Difference]: With dead ends: 580 [2021-08-27 07:49:06,527 INFO L226 Difference]: Without dead ends: 580 [2021-08-27 07:49:06,527 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 367.9ms TimeCoverageRelationStatistics Valid=51, Invalid=105, Unknown=0, NotChecked=0, Total=156 [2021-08-27 07:49:06,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 580 states. [2021-08-27 07:49:06,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 580 to 528. [2021-08-27 07:49:06,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 528 states, 416 states have (on average 1.2740384615384615) internal successors, (530), 427 states have internal predecessors, (530), 62 states have call successors, (62), 43 states have call predecessors, (62), 49 states have return successors, (75), 59 states have call predecessors, (75), 54 states have call successors, (75) [2021-08-27 07:49:06,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 528 states to 528 states and 667 transitions. [2021-08-27 07:49:06,539 INFO L78 Accepts]: Start accepts. Automaton has 528 states and 667 transitions. Word has length 49 [2021-08-27 07:49:06,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 07:49:06,540 INFO L470 AbstractCegarLoop]: Abstraction has 528 states and 667 transitions. [2021-08-27 07:49:06,540 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.5) internal successors, (36), 4 states have internal predecessors, (36), 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-08-27 07:49:06,540 INFO L276 IsEmpty]: Start isEmpty. Operand 528 states and 667 transitions. [2021-08-27 07:49:06,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2021-08-27 07:49:06,541 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 07:49:06,541 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-08-27 07:49:06,541 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-08-27 07:49:06,542 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2021-08-27 07:49:06,542 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 07:49:06,542 INFO L82 PathProgramCache]: Analyzing trace with hash -6834350, now seen corresponding path program 1 times [2021-08-27 07:49:06,542 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 07:49:06,542 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [870464737] [2021-08-27 07:49:06,543 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 07:49:06,543 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 07:49:06,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:06,669 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 07:49:06,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:06,703 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-08-27 07:49:06,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:06,719 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-08-27 07:49:06,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:06,732 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2021-08-27 07:49:06,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:06,735 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-08-27 07:49:06,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:06,745 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2021-08-27 07:49:06,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:06,751 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 07:49:06,751 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 07:49:06,751 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [870464737] [2021-08-27 07:49:06,751 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [870464737] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 07:49:06,751 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 07:49:06,751 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-08-27 07:49:06,752 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [434052562] [2021-08-27 07:49:06,752 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-08-27 07:49:06,752 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 07:49:06,752 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-08-27 07:49:06,753 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2021-08-27 07:49:06,753 INFO L87 Difference]: Start difference. First operand 528 states and 667 transitions. Second operand has 8 states, 8 states have (on average 4.75) internal successors, (38), 3 states have internal predecessors, (38), 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-08-27 07:49:07,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 07:49:07,557 INFO L93 Difference]: Finished difference Result 569 states and 720 transitions. [2021-08-27 07:49:07,558 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-08-27 07:49:07,558 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.75) internal successors, (38), 3 states have internal predecessors, (38), 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 55 [2021-08-27 07:49:07,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 07:49:07,560 INFO L225 Difference]: With dead ends: 569 [2021-08-27 07:49:07,560 INFO L226 Difference]: Without dead ends: 569 [2021-08-27 07:49:07,561 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 244.1ms TimeCoverageRelationStatistics Valid=48, Invalid=84, Unknown=0, NotChecked=0, Total=132 [2021-08-27 07:49:07,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 569 states. [2021-08-27 07:49:07,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 569 to 542. [2021-08-27 07:49:07,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 542 states, 429 states have (on average 1.275058275058275) internal successors, (547), 440 states have internal predecessors, (547), 62 states have call successors, (62), 43 states have call predecessors, (62), 50 states have return successors, (78), 59 states have call predecessors, (78), 54 states have call successors, (78) [2021-08-27 07:49:07,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 542 states to 542 states and 687 transitions. [2021-08-27 07:49:07,571 INFO L78 Accepts]: Start accepts. Automaton has 542 states and 687 transitions. Word has length 55 [2021-08-27 07:49:07,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 07:49:07,571 INFO L470 AbstractCegarLoop]: Abstraction has 542 states and 687 transitions. [2021-08-27 07:49:07,571 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.75) internal successors, (38), 3 states have internal predecessors, (38), 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-08-27 07:49:07,572 INFO L276 IsEmpty]: Start isEmpty. Operand 542 states and 687 transitions. [2021-08-27 07:49:07,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2021-08-27 07:49:07,572 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 07:49:07,573 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-08-27 07:49:07,573 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-08-27 07:49:07,573 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2021-08-27 07:49:07,573 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 07:49:07,573 INFO L82 PathProgramCache]: Analyzing trace with hash -2114913751, now seen corresponding path program 1 times [2021-08-27 07:49:07,574 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 07:49:07,574 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [666638221] [2021-08-27 07:49:07,574 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 07:49:07,574 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 07:49:07,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:07,694 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 07:49:07,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:07,725 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-08-27 07:49:07,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:07,745 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-08-27 07:49:07,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:07,768 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-08-27 07:49:07,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:07,816 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-08-27 07:49:07,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:07,846 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 07:49:07,848 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 07:49:07,848 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [666638221] [2021-08-27 07:49:07,850 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [666638221] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 07:49:07,850 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 07:49:07,850 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-08-27 07:49:07,850 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [557301585] [2021-08-27 07:49:07,851 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-08-27 07:49:07,851 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 07:49:07,851 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-08-27 07:49:07,851 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2021-08-27 07:49:07,851 INFO L87 Difference]: Start difference. First operand 542 states and 687 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-08-27 07:49:09,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 07:49:09,822 INFO L93 Difference]: Finished difference Result 714 states and 903 transitions. [2021-08-27 07:49:09,823 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2021-08-27 07:49:09,823 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-08-27 07:49:09,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 07:49:09,826 INFO L225 Difference]: With dead ends: 714 [2021-08-27 07:49:09,826 INFO L226 Difference]: Without dead ends: 714 [2021-08-27 07:49:09,826 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 121 ImplicationChecksByTransitivity, 851.3ms TimeCoverageRelationStatistics Valid=160, Invalid=490, Unknown=0, NotChecked=0, Total=650 [2021-08-27 07:49:09,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 714 states. [2021-08-27 07:49:09,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 714 to 571. [2021-08-27 07:49:09,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 571 states, 452 states have (on average 1.2676991150442478) internal successors, (573), 464 states have internal predecessors, (573), 64 states have call successors, (64), 44 states have call predecessors, (64), 54 states have return successors, (83), 63 states have call predecessors, (83), 56 states have call successors, (83) [2021-08-27 07:49:09,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 571 states to 571 states and 720 transitions. [2021-08-27 07:49:09,840 INFO L78 Accepts]: Start accepts. Automaton has 571 states and 720 transitions. Word has length 52 [2021-08-27 07:49:09,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 07:49:09,840 INFO L470 AbstractCegarLoop]: Abstraction has 571 states and 720 transitions. [2021-08-27 07:49:09,840 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-08-27 07:49:09,840 INFO L276 IsEmpty]: Start isEmpty. Operand 571 states and 720 transitions. [2021-08-27 07:49:09,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2021-08-27 07:49:09,841 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 07:49:09,841 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-08-27 07:49:09,842 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-08-27 07:49:09,842 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2021-08-27 07:49:09,843 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 07:49:09,843 INFO L82 PathProgramCache]: Analyzing trace with hash -632991762, now seen corresponding path program 1 times [2021-08-27 07:49:09,843 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 07:49:09,843 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [77838799] [2021-08-27 07:49:09,843 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 07:49:09,844 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 07:49:09,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:09,978 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 07:49:09,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:10,011 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-08-27 07:49:10,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:10,028 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-08-27 07:49:10,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:10,047 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-08-27 07:49:10,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:10,065 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-08-27 07:49:10,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:10,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-08-27 07:49:10,081 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 07:49:10,081 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [77838799] [2021-08-27 07:49:10,081 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [77838799] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 07:49:10,082 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 07:49:10,082 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-08-27 07:49:10,082 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [847522370] [2021-08-27 07:49:10,083 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-08-27 07:49:10,083 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 07:49:10,083 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-08-27 07:49:10,083 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2021-08-27 07:49:10,084 INFO L87 Difference]: Start difference. First operand 571 states and 720 transitions. Second operand has 8 states, 8 states have (on average 5.25) internal successors, (42), 3 states have internal predecessors, (42), 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-08-27 07:49:10,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 07:49:10,947 INFO L93 Difference]: Finished difference Result 638 states and 811 transitions. [2021-08-27 07:49:10,947 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-08-27 07:49:10,947 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.25) internal successors, (42), 3 states have internal predecessors, (42), 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 54 [2021-08-27 07:49:10,948 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 07:49:10,950 INFO L225 Difference]: With dead ends: 638 [2021-08-27 07:49:10,950 INFO L226 Difference]: Without dead ends: 638 [2021-08-27 07:49:10,951 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 234.3ms TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2021-08-27 07:49:10,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 638 states. [2021-08-27 07:49:10,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 638 to 583. [2021-08-27 07:49:10,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 583 states, 464 states have (on average 1.271551724137931) internal successors, (590), 476 states have internal predecessors, (590), 64 states have call successors, (64), 44 states have call predecessors, (64), 54 states have return successors, (83), 63 states have call predecessors, (83), 56 states have call successors, (83) [2021-08-27 07:49:10,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 583 states to 583 states and 737 transitions. [2021-08-27 07:49:10,963 INFO L78 Accepts]: Start accepts. Automaton has 583 states and 737 transitions. Word has length 54 [2021-08-27 07:49:10,963 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 07:49:10,963 INFO L470 AbstractCegarLoop]: Abstraction has 583 states and 737 transitions. [2021-08-27 07:49:10,964 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.25) internal successors, (42), 3 states have internal predecessors, (42), 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-08-27 07:49:10,964 INFO L276 IsEmpty]: Start isEmpty. Operand 583 states and 737 transitions. [2021-08-27 07:49:10,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2021-08-27 07:49:10,966 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 07:49:10,966 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-08-27 07:49:10,966 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-08-27 07:49:10,966 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2021-08-27 07:49:10,966 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 07:49:10,967 INFO L82 PathProgramCache]: Analyzing trace with hash 2073627632, now seen corresponding path program 1 times [2021-08-27 07:49:10,967 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 07:49:10,967 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [732508819] [2021-08-27 07:49:10,967 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 07:49:10,967 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 07:49:10,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:11,090 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 07:49:11,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:11,126 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-08-27 07:49:11,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:11,148 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-08-27 07:49:11,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:11,171 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-08-27 07:49:11,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:11,208 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-08-27 07:49:11,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:11,233 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 07:49:11,233 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 07:49:11,233 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [732508819] [2021-08-27 07:49:11,233 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [732508819] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 07:49:11,233 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 07:49:11,234 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-08-27 07:49:11,234 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2124297097] [2021-08-27 07:49:11,235 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-08-27 07:49:11,235 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 07:49:11,236 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-08-27 07:49:11,236 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2021-08-27 07:49:11,236 INFO L87 Difference]: Start difference. First operand 583 states and 737 transitions. Second operand has 12 states, 12 states have (on average 3.5) internal successors, (42), 7 states have internal predecessors, (42), 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-08-27 07:49:12,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 07:49:12,938 INFO L93 Difference]: Finished difference Result 611 states and 769 transitions. [2021-08-27 07:49:12,941 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-08-27 07:49:12,941 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.5) internal successors, (42), 7 states have internal predecessors, (42), 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 54 [2021-08-27 07:49:12,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 07:49:12,943 INFO L225 Difference]: With dead ends: 611 [2021-08-27 07:49:12,943 INFO L226 Difference]: Without dead ends: 611 [2021-08-27 07:49:12,945 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 628.4ms TimeCoverageRelationStatistics Valid=112, Invalid=350, Unknown=0, NotChecked=0, Total=462 [2021-08-27 07:49:12,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 611 states. [2021-08-27 07:49:12,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 611 to 564. [2021-08-27 07:49:12,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 564 states, 447 states have (on average 1.2662192393736018) internal successors, (566), 459 states have internal predecessors, (566), 64 states have call successors, (64), 44 states have call predecessors, (64), 52 states have return successors, (81), 61 states have call predecessors, (81), 56 states have call successors, (81) [2021-08-27 07:49:12,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 564 states to 564 states and 711 transitions. [2021-08-27 07:49:12,957 INFO L78 Accepts]: Start accepts. Automaton has 564 states and 711 transitions. Word has length 54 [2021-08-27 07:49:12,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 07:49:12,957 INFO L470 AbstractCegarLoop]: Abstraction has 564 states and 711 transitions. [2021-08-27 07:49:12,957 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.5) internal successors, (42), 7 states have internal predecessors, (42), 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-08-27 07:49:12,958 INFO L276 IsEmpty]: Start isEmpty. Operand 564 states and 711 transitions. [2021-08-27 07:49:12,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2021-08-27 07:49:12,961 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 07:49:12,961 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-08-27 07:49:12,961 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2021-08-27 07:49:12,962 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2021-08-27 07:49:12,962 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 07:49:12,962 INFO L82 PathProgramCache]: Analyzing trace with hash -2078060306, now seen corresponding path program 1 times [2021-08-27 07:49:12,962 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 07:49:12,962 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [297129578] [2021-08-27 07:49:12,962 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 07:49:12,963 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 07:49:12,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:13,079 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 07:49:13,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:13,120 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-08-27 07:49:13,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:13,137 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-08-27 07:49:13,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:13,156 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-08-27 07:49:13,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:13,180 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-08-27 07:49:13,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:13,187 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 07:49:13,187 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 07:49:13,187 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [297129578] [2021-08-27 07:49:13,187 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [297129578] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 07:49:13,187 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 07:49:13,187 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-08-27 07:49:13,188 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1333942574] [2021-08-27 07:49:13,189 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-08-27 07:49:13,189 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 07:49:13,189 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-08-27 07:49:13,190 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2021-08-27 07:49:13,190 INFO L87 Difference]: Start difference. First operand 564 states and 711 transitions. Second operand has 8 states, 8 states have (on average 5.25) internal successors, (42), 3 states have internal predecessors, (42), 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-08-27 07:49:14,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 07:49:14,330 INFO L93 Difference]: Finished difference Result 666 states and 840 transitions. [2021-08-27 07:49:14,330 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-08-27 07:49:14,331 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.25) internal successors, (42), 3 states have internal predecessors, (42), 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 54 [2021-08-27 07:49:14,331 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 07:49:14,332 INFO L225 Difference]: With dead ends: 666 [2021-08-27 07:49:14,332 INFO L226 Difference]: Without dead ends: 666 [2021-08-27 07:49:14,332 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 232.2ms TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2021-08-27 07:49:14,333 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 666 states. [2021-08-27 07:49:14,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 666 to 580. [2021-08-27 07:49:14,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 580 states, 461 states have (on average 1.2668112798264641) internal successors, (584), 473 states have internal predecessors, (584), 64 states have call successors, (64), 45 states have call predecessors, (64), 54 states have return successors, (85), 62 states have call predecessors, (85), 57 states have call successors, (85) [2021-08-27 07:49:14,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 580 states to 580 states and 733 transitions. [2021-08-27 07:49:14,344 INFO L78 Accepts]: Start accepts. Automaton has 580 states and 733 transitions. Word has length 54 [2021-08-27 07:49:14,344 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 07:49:14,344 INFO L470 AbstractCegarLoop]: Abstraction has 580 states and 733 transitions. [2021-08-27 07:49:14,344 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.25) internal successors, (42), 3 states have internal predecessors, (42), 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-08-27 07:49:14,344 INFO L276 IsEmpty]: Start isEmpty. Operand 580 states and 733 transitions. [2021-08-27 07:49:14,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2021-08-27 07:49:14,345 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 07:49:14,346 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] [2021-08-27 07:49:14,346 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2021-08-27 07:49:14,346 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2021-08-27 07:49:14,346 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 07:49:14,346 INFO L82 PathProgramCache]: Analyzing trace with hash 2007283295, now seen corresponding path program 1 times [2021-08-27 07:49:14,347 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 07:49:14,347 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [646372573] [2021-08-27 07:49:14,347 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 07:49:14,347 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 07:49:14,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:14,476 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 07:49:14,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:14,517 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-08-27 07:49:14,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:14,535 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-08-27 07:49:14,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:14,548 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2021-08-27 07:49:14,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:14,641 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-08-27 07:49:14,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:14,664 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-08-27 07:49:14,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:14,668 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 07:49:14,668 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 07:49:14,668 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [646372573] [2021-08-27 07:49:14,668 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [646372573] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 07:49:14,668 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 07:49:14,668 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-08-27 07:49:14,669 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [706369543] [2021-08-27 07:49:14,669 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-08-27 07:49:14,669 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 07:49:14,670 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-08-27 07:49:14,670 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2021-08-27 07:49:14,670 INFO L87 Difference]: Start difference. First operand 580 states and 733 transitions. Second operand has 10 states, 10 states have (on average 4.5) internal successors, (45), 4 states have internal predecessors, (45), 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-08-27 07:49:15,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 07:49:15,779 INFO L93 Difference]: Finished difference Result 544 states and 676 transitions. [2021-08-27 07:49:15,779 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-08-27 07:49:15,779 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.5) internal successors, (45), 4 states have internal predecessors, (45), 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 61 [2021-08-27 07:49:15,779 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 07:49:15,781 INFO L225 Difference]: With dead ends: 544 [2021-08-27 07:49:15,781 INFO L226 Difference]: Without dead ends: 544 [2021-08-27 07:49:15,781 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 168.0ms TimeCoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2021-08-27 07:49:15,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 544 states. [2021-08-27 07:49:15,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 544 to 506. [2021-08-27 07:49:15,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 506 states, 398 states have (on average 1.2487437185929648) internal successors, (497), 406 states have internal predecessors, (497), 60 states have call successors, (60), 43 states have call predecessors, (60), 47 states have return successors, (70), 57 states have call predecessors, (70), 54 states have call successors, (70) [2021-08-27 07:49:15,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 506 states to 506 states and 627 transitions. [2021-08-27 07:49:15,791 INFO L78 Accepts]: Start accepts. Automaton has 506 states and 627 transitions. Word has length 61 [2021-08-27 07:49:15,791 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 07:49:15,791 INFO L470 AbstractCegarLoop]: Abstraction has 506 states and 627 transitions. [2021-08-27 07:49:15,791 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.5) internal successors, (45), 4 states have internal predecessors, (45), 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-08-27 07:49:15,791 INFO L276 IsEmpty]: Start isEmpty. Operand 506 states and 627 transitions. [2021-08-27 07:49:15,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2021-08-27 07:49:15,792 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 07:49:15,793 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-08-27 07:49:15,793 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2021-08-27 07:49:15,793 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2021-08-27 07:49:15,793 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 07:49:15,794 INFO L82 PathProgramCache]: Analyzing trace with hash 456516591, now seen corresponding path program 1 times [2021-08-27 07:49:15,794 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 07:49:15,794 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [647739947] [2021-08-27 07:49:15,794 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 07:49:15,794 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 07:49:15,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:15,918 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 07:49:15,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:15,953 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-08-27 07:49:15,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:15,972 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-08-27 07:49:15,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:15,992 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-08-27 07:49:15,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:16,043 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-08-27 07:49:16,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:16,082 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 07:49:16,083 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 07:49:16,083 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [647739947] [2021-08-27 07:49:16,083 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [647739947] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 07:49:16,083 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 07:49:16,083 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2021-08-27 07:49:16,083 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [263679160] [2021-08-27 07:49:16,084 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-08-27 07:49:16,085 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 07:49:16,085 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-08-27 07:49:16,085 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2021-08-27 07:49:16,085 INFO L87 Difference]: Start difference. First operand 506 states and 627 transitions. Second operand has 13 states, 13 states have (on average 3.3076923076923075) internal successors, (43), 6 states have internal predecessors, (43), 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-08-27 07:49:17,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 07:49:17,127 INFO L93 Difference]: Finished difference Result 568 states and 708 transitions. [2021-08-27 07:49:17,127 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-08-27 07:49:17,128 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 3.3076923076923075) internal successors, (43), 6 states have internal predecessors, (43), 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 55 [2021-08-27 07:49:17,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 07:49:17,130 INFO L225 Difference]: With dead ends: 568 [2021-08-27 07:49:17,130 INFO L226 Difference]: Without dead ends: 567 [2021-08-27 07:49:17,130 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 321.2ms TimeCoverageRelationStatistics Valid=48, Invalid=192, Unknown=0, NotChecked=0, Total=240 [2021-08-27 07:49:17,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 567 states. [2021-08-27 07:49:17,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 567 to 523. [2021-08-27 07:49:17,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 523 states, 413 states have (on average 1.2397094430992737) internal successors, (512), 421 states have internal predecessors, (512), 60 states have call successors, (60), 43 states have call predecessors, (60), 49 states have return successors, (77), 59 states have call predecessors, (77), 54 states have call successors, (77) [2021-08-27 07:49:17,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 523 states to 523 states and 649 transitions. [2021-08-27 07:49:17,139 INFO L78 Accepts]: Start accepts. Automaton has 523 states and 649 transitions. Word has length 55 [2021-08-27 07:49:17,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 07:49:17,139 INFO L470 AbstractCegarLoop]: Abstraction has 523 states and 649 transitions. [2021-08-27 07:49:17,140 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 3.3076923076923075) internal successors, (43), 6 states have internal predecessors, (43), 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-08-27 07:49:17,140 INFO L276 IsEmpty]: Start isEmpty. Operand 523 states and 649 transitions. [2021-08-27 07:49:17,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2021-08-27 07:49:17,141 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 07:49:17,141 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-08-27 07:49:17,141 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2021-08-27 07:49:17,141 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2021-08-27 07:49:17,141 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 07:49:17,142 INFO L82 PathProgramCache]: Analyzing trace with hash 456793421, now seen corresponding path program 1 times [2021-08-27 07:49:17,142 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 07:49:17,142 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [888963583] [2021-08-27 07:49:17,142 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 07:49:17,142 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 07:49:17,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:17,268 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 07:49:17,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:17,305 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-08-27 07:49:17,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:17,324 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-08-27 07:49:17,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:17,345 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-08-27 07:49:17,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:17,384 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-08-27 07:49:17,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:17,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-08-27 07:49:17,411 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 07:49:17,412 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [888963583] [2021-08-27 07:49:17,412 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [888963583] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 07:49:17,412 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 07:49:17,412 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2021-08-27 07:49:17,412 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1011473312] [2021-08-27 07:49:17,413 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-08-27 07:49:17,413 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 07:49:17,413 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-08-27 07:49:17,413 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2021-08-27 07:49:17,413 INFO L87 Difference]: Start difference. First operand 523 states and 649 transitions. Second operand has 13 states, 13 states have (on average 3.3076923076923075) internal successors, (43), 6 states have internal predecessors, (43), 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-08-27 07:49:18,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 07:49:18,475 INFO L93 Difference]: Finished difference Result 563 states and 696 transitions. [2021-08-27 07:49:18,475 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-08-27 07:49:18,476 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 3.3076923076923075) internal successors, (43), 6 states have internal predecessors, (43), 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 55 [2021-08-27 07:49:18,476 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 07:49:18,478 INFO L225 Difference]: With dead ends: 563 [2021-08-27 07:49:18,478 INFO L226 Difference]: Without dead ends: 551 [2021-08-27 07:49:18,479 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 204.2ms TimeCoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2021-08-27 07:49:18,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 551 states. [2021-08-27 07:49:18,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 551 to 520. [2021-08-27 07:49:18,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 520 states, 410 states have (on average 1.2414634146341463) internal successors, (509), 419 states have internal predecessors, (509), 60 states have call successors, (60), 43 states have call predecessors, (60), 49 states have return successors, (76), 58 states have call predecessors, (76), 54 states have call successors, (76) [2021-08-27 07:49:18,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 520 states to 520 states and 645 transitions. [2021-08-27 07:49:18,488 INFO L78 Accepts]: Start accepts. Automaton has 520 states and 645 transitions. Word has length 55 [2021-08-27 07:49:18,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 07:49:18,488 INFO L470 AbstractCegarLoop]: Abstraction has 520 states and 645 transitions. [2021-08-27 07:49:18,489 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 3.3076923076923075) internal successors, (43), 6 states have internal predecessors, (43), 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-08-27 07:49:18,489 INFO L276 IsEmpty]: Start isEmpty. Operand 520 states and 645 transitions. [2021-08-27 07:49:18,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2021-08-27 07:49:18,490 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 07:49:18,490 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] [2021-08-27 07:49:18,490 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2021-08-27 07:49:18,490 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2021-08-27 07:49:18,491 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 07:49:18,491 INFO L82 PathProgramCache]: Analyzing trace with hash 1713148089, now seen corresponding path program 1 times [2021-08-27 07:49:18,491 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 07:49:18,491 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [908014202] [2021-08-27 07:49:18,491 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 07:49:18,491 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 07:49:18,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:18,619 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 07:49:18,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:18,652 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-08-27 07:49:18,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:18,670 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-08-27 07:49:18,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:18,691 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-08-27 07:49:18,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:18,735 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2021-08-27 07:49:18,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:18,750 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2021-08-27 07:49:18,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:18,754 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 07:49:18,754 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 07:49:18,754 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [908014202] [2021-08-27 07:49:18,754 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [908014202] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 07:49:18,754 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 07:49:18,754 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-08-27 07:49:18,755 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1501366418] [2021-08-27 07:49:18,756 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-08-27 07:49:18,756 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 07:49:18,756 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-08-27 07:49:18,756 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2021-08-27 07:49:18,757 INFO L87 Difference]: Start difference. First operand 520 states and 645 transitions. Second operand has 12 states, 12 states have (on average 3.5833333333333335) internal successors, (43), 5 states have internal predecessors, (43), 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-08-27 07:49:20,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 07:49:20,058 INFO L93 Difference]: Finished difference Result 563 states and 695 transitions. [2021-08-27 07:49:20,059 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-08-27 07:49:20,059 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.5833333333333335) internal successors, (43), 5 states have internal predecessors, (43), 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 57 [2021-08-27 07:49:20,059 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 07:49:20,061 INFO L225 Difference]: With dead ends: 563 [2021-08-27 07:49:20,061 INFO L226 Difference]: Without dead ends: 523 [2021-08-27 07:49:20,061 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 249.0ms TimeCoverageRelationStatistics Valid=53, Invalid=187, Unknown=0, NotChecked=0, Total=240 [2021-08-27 07:49:20,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 523 states. [2021-08-27 07:49:20,068 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 523 to 496. [2021-08-27 07:49:20,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 496 states, 392 states have (on average 1.2372448979591837) internal successors, (485), 400 states have internal predecessors, (485), 58 states have call successors, (58), 41 states have call predecessors, (58), 45 states have return successors, (72), 55 states have call predecessors, (72), 52 states have call successors, (72) [2021-08-27 07:49:20,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 496 states to 496 states and 615 transitions. [2021-08-27 07:49:20,070 INFO L78 Accepts]: Start accepts. Automaton has 496 states and 615 transitions. Word has length 57 [2021-08-27 07:49:20,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 07:49:20,070 INFO L470 AbstractCegarLoop]: Abstraction has 496 states and 615 transitions. [2021-08-27 07:49:20,070 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.5833333333333335) internal successors, (43), 5 states have internal predecessors, (43), 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-08-27 07:49:20,070 INFO L276 IsEmpty]: Start isEmpty. Operand 496 states and 615 transitions. [2021-08-27 07:49:20,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2021-08-27 07:49:20,071 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 07:49:20,071 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] [2021-08-27 07:49:20,072 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2021-08-27 07:49:20,072 INFO L402 AbstractCegarLoop]: === Iteration 24 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2021-08-27 07:49:20,072 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 07:49:20,072 INFO L82 PathProgramCache]: Analyzing trace with hash 471512753, now seen corresponding path program 1 times [2021-08-27 07:49:20,072 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 07:49:20,073 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [52741963] [2021-08-27 07:49:20,073 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 07:49:20,073 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 07:49:20,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:20,200 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 07:49:20,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:20,232 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-08-27 07:49:20,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:20,253 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-08-27 07:49:20,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:20,274 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-08-27 07:49:20,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:20,305 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-08-27 07:49:20,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:20,312 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 07:49:20,313 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 07:49:20,313 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [52741963] [2021-08-27 07:49:20,313 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [52741963] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 07:49:20,313 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 07:49:20,313 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-08-27 07:49:20,313 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [592332664] [2021-08-27 07:49:20,314 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-08-27 07:49:20,314 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 07:49:20,314 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-08-27 07:49:20,314 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2021-08-27 07:49:20,314 INFO L87 Difference]: Start difference. First operand 496 states and 615 transitions. Second operand has 10 states, 10 states have (on average 4.4) internal successors, (44), 5 states have internal predecessors, (44), 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-08-27 07:49:21,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 07:49:21,540 INFO L93 Difference]: Finished difference Result 527 states and 650 transitions. [2021-08-27 07:49:21,540 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-08-27 07:49:21,540 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.4) internal successors, (44), 5 states have internal predecessors, (44), 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 56 [2021-08-27 07:49:21,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 07:49:21,542 INFO L225 Difference]: With dead ends: 527 [2021-08-27 07:49:21,542 INFO L226 Difference]: Without dead ends: 513 [2021-08-27 07:49:21,542 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 611.5ms TimeCoverageRelationStatistics Valid=81, Invalid=191, Unknown=0, NotChecked=0, Total=272 [2021-08-27 07:49:21,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 513 states. [2021-08-27 07:49:21,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 513 to 478. [2021-08-27 07:49:21,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 478 states, 377 states have (on average 1.2413793103448276) internal successors, (468), 384 states have internal predecessors, (468), 57 states have call successors, (57), 41 states have call predecessors, (57), 43 states have return successors, (65), 53 states have call predecessors, (65), 51 states have call successors, (65) [2021-08-27 07:49:21,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 478 states to 478 states and 590 transitions. [2021-08-27 07:49:21,550 INFO L78 Accepts]: Start accepts. Automaton has 478 states and 590 transitions. Word has length 56 [2021-08-27 07:49:21,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 07:49:21,551 INFO L470 AbstractCegarLoop]: Abstraction has 478 states and 590 transitions. [2021-08-27 07:49:21,551 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.4) internal successors, (44), 5 states have internal predecessors, (44), 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-08-27 07:49:21,551 INFO L276 IsEmpty]: Start isEmpty. Operand 478 states and 590 transitions. [2021-08-27 07:49:21,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2021-08-27 07:49:21,552 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 07:49:21,552 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] [2021-08-27 07:49:21,552 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2021-08-27 07:49:21,552 INFO L402 AbstractCegarLoop]: === Iteration 25 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2021-08-27 07:49:21,553 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 07:49:21,553 INFO L82 PathProgramCache]: Analyzing trace with hash -70909626, now seen corresponding path program 1 times [2021-08-27 07:49:21,553 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 07:49:21,553 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1308764242] [2021-08-27 07:49:21,553 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 07:49:21,553 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 07:49:21,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:21,670 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 07:49:21,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:21,714 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-08-27 07:49:21,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:21,735 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-08-27 07:49:21,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:21,748 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2021-08-27 07:49:21,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:21,790 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-08-27 07:49:21,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:21,793 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-08-27 07:49:21,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:21,804 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-08-27 07:49:21,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:21,817 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 07:49:21,818 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 07:49:21,818 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1308764242] [2021-08-27 07:49:21,818 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1308764242] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 07:49:21,818 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 07:49:21,818 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-08-27 07:49:21,818 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1750063691] [2021-08-27 07:49:21,819 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-08-27 07:49:21,819 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 07:49:21,819 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-08-27 07:49:21,819 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2021-08-27 07:49:21,820 INFO L87 Difference]: Start difference. First operand 478 states and 590 transitions. Second operand has 12 states, 12 states have (on average 3.9166666666666665) internal successors, (47), 6 states have internal predecessors, (47), 3 states have call successors, (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-08-27 07:49:23,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 07:49:23,156 INFO L93 Difference]: Finished difference Result 511 states and 631 transitions. [2021-08-27 07:49:23,156 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-08-27 07:49:23,157 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.9166666666666665) internal successors, (47), 6 states have internal predecessors, (47), 3 states have call successors, (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 65 [2021-08-27 07:49:23,157 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 07:49:23,158 INFO L225 Difference]: With dead ends: 511 [2021-08-27 07:49:23,159 INFO L226 Difference]: Without dead ends: 511 [2021-08-27 07:49:23,159 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 444.0ms TimeCoverageRelationStatistics Valid=106, Invalid=314, Unknown=0, NotChecked=0, Total=420 [2021-08-27 07:49:23,159 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 511 states. [2021-08-27 07:49:23,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 511 to 478. [2021-08-27 07:49:23,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 478 states, 377 states have (on average 1.2360742705570291) internal successors, (466), 384 states have internal predecessors, (466), 57 states have call successors, (57), 41 states have call predecessors, (57), 43 states have return successors, (65), 53 states have call predecessors, (65), 51 states have call successors, (65) [2021-08-27 07:49:23,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 478 states to 478 states and 588 transitions. [2021-08-27 07:49:23,167 INFO L78 Accepts]: Start accepts. Automaton has 478 states and 588 transitions. Word has length 65 [2021-08-27 07:49:23,167 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 07:49:23,167 INFO L470 AbstractCegarLoop]: Abstraction has 478 states and 588 transitions. [2021-08-27 07:49:23,167 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.9166666666666665) internal successors, (47), 6 states have internal predecessors, (47), 3 states have call successors, (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-08-27 07:49:23,167 INFO L276 IsEmpty]: Start isEmpty. Operand 478 states and 588 transitions. [2021-08-27 07:49:23,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2021-08-27 07:49:23,168 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 07:49:23,168 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-08-27 07:49:23,168 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2021-08-27 07:49:23,169 INFO L402 AbstractCegarLoop]: === Iteration 26 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2021-08-27 07:49:23,169 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 07:49:23,169 INFO L82 PathProgramCache]: Analyzing trace with hash -876554703, now seen corresponding path program 1 times [2021-08-27 07:49:23,169 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 07:49:23,169 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1684148178] [2021-08-27 07:49:23,169 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 07:49:23,170 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 07:49:23,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:23,285 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 07:49:23,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:23,316 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-08-27 07:49:23,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:23,333 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-08-27 07:49:23,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:23,352 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-08-27 07:49:23,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:23,399 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-08-27 07:49:23,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:23,425 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 07:49:23,425 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 07:49:23,426 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1684148178] [2021-08-27 07:49:23,426 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1684148178] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 07:49:23,426 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 07:49:23,426 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2021-08-27 07:49:23,426 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1473780212] [2021-08-27 07:49:23,426 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2021-08-27 07:49:23,427 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 07:49:23,427 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-08-27 07:49:23,427 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=148, Unknown=0, NotChecked=0, Total=182 [2021-08-27 07:49:23,427 INFO L87 Difference]: Start difference. First operand 478 states and 588 transitions. Second operand has 14 states, 14 states have (on average 3.4285714285714284) internal successors, (48), 7 states have internal predecessors, (48), 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-08-27 07:49:24,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 07:49:24,461 INFO L93 Difference]: Finished difference Result 519 states and 636 transitions. [2021-08-27 07:49:24,461 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-08-27 07:49:24,461 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 3.4285714285714284) internal successors, (48), 7 states have internal predecessors, (48), 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 60 [2021-08-27 07:49:24,462 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 07:49:24,463 INFO L225 Difference]: With dead ends: 519 [2021-08-27 07:49:24,463 INFO L226 Difference]: Without dead ends: 501 [2021-08-27 07:49:24,464 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 208.4ms TimeCoverageRelationStatistics Valid=42, Invalid=198, Unknown=0, NotChecked=0, Total=240 [2021-08-27 07:49:24,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 501 states. [2021-08-27 07:49:24,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 501 to 474. [2021-08-27 07:49:24,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 474 states, 374 states have (on average 1.2352941176470589) internal successors, (462), 381 states have internal predecessors, (462), 56 states have call successors, (56), 41 states have call predecessors, (56), 43 states have return successors, (64), 52 states have call predecessors, (64), 50 states have call successors, (64) [2021-08-27 07:49:24,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 474 states to 474 states and 582 transitions. [2021-08-27 07:49:24,471 INFO L78 Accepts]: Start accepts. Automaton has 474 states and 582 transitions. Word has length 60 [2021-08-27 07:49:24,472 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 07:49:24,472 INFO L470 AbstractCegarLoop]: Abstraction has 474 states and 582 transitions. [2021-08-27 07:49:24,472 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 3.4285714285714284) internal successors, (48), 7 states have internal predecessors, (48), 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-08-27 07:49:24,472 INFO L276 IsEmpty]: Start isEmpty. Operand 474 states and 582 transitions. [2021-08-27 07:49:24,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2021-08-27 07:49:24,473 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 07:49:24,473 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-08-27 07:49:24,473 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2021-08-27 07:49:24,474 INFO L402 AbstractCegarLoop]: === Iteration 27 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2021-08-27 07:49:24,474 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 07:49:24,474 INFO L82 PathProgramCache]: Analyzing trace with hash -863080833, now seen corresponding path program 1 times [2021-08-27 07:49:24,474 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 07:49:24,474 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [926630489] [2021-08-27 07:49:24,474 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 07:49:24,475 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 07:49:24,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:24,610 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 07:49:24,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:24,644 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-08-27 07:49:24,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:24,662 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-08-27 07:49:24,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:24,676 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2021-08-27 07:49:24,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:24,725 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-08-27 07:49:24,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:24,728 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-08-27 07:49:24,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:24,741 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-08-27 07:49:24,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:24,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-08-27 07:49:24,745 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 07:49:24,745 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [926630489] [2021-08-27 07:49:24,745 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [926630489] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 07:49:24,745 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 07:49:24,745 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-08-27 07:49:24,745 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2119961715] [2021-08-27 07:49:24,746 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-08-27 07:49:24,746 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 07:49:24,746 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-08-27 07:49:24,746 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2021-08-27 07:49:24,747 INFO L87 Difference]: Start difference. First operand 474 states and 582 transitions. Second operand has 12 states, 12 states have (on average 4.166666666666667) internal successors, (50), 5 states have internal predecessors, (50), 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-08-27 07:49:25,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 07:49:25,749 INFO L93 Difference]: Finished difference Result 526 states and 647 transitions. [2021-08-27 07:49:25,749 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-08-27 07:49:25,749 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 4.166666666666667) internal successors, (50), 5 states have internal predecessors, (50), 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 68 [2021-08-27 07:49:25,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 07:49:25,750 INFO L225 Difference]: With dead ends: 526 [2021-08-27 07:49:25,751 INFO L226 Difference]: Without dead ends: 526 [2021-08-27 07:49:25,751 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 314.6ms TimeCoverageRelationStatistics Valid=60, Invalid=180, Unknown=0, NotChecked=0, Total=240 [2021-08-27 07:49:25,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 526 states. [2021-08-27 07:49:25,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 526 to 474. [2021-08-27 07:49:25,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 474 states, 374 states have (on average 1.2299465240641712) internal successors, (460), 381 states have internal predecessors, (460), 56 states have call successors, (56), 41 states have call predecessors, (56), 43 states have return successors, (64), 52 states have call predecessors, (64), 50 states have call successors, (64) [2021-08-27 07:49:25,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 474 states to 474 states and 580 transitions. [2021-08-27 07:49:25,758 INFO L78 Accepts]: Start accepts. Automaton has 474 states and 580 transitions. Word has length 68 [2021-08-27 07:49:25,758 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 07:49:25,758 INFO L470 AbstractCegarLoop]: Abstraction has 474 states and 580 transitions. [2021-08-27 07:49:25,758 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 4.166666666666667) internal successors, (50), 5 states have internal predecessors, (50), 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-08-27 07:49:25,759 INFO L276 IsEmpty]: Start isEmpty. Operand 474 states and 580 transitions. [2021-08-27 07:49:25,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2021-08-27 07:49:25,759 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 07:49:25,760 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] [2021-08-27 07:49:25,760 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2021-08-27 07:49:25,760 INFO L402 AbstractCegarLoop]: === Iteration 28 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2021-08-27 07:49:25,760 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 07:49:25,760 INFO L82 PathProgramCache]: Analyzing trace with hash -1815591607, now seen corresponding path program 1 times [2021-08-27 07:49:25,761 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 07:49:25,761 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1156250139] [2021-08-27 07:49:25,761 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 07:49:25,761 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 07:49:25,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:25,876 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 07:49:25,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:25,907 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-08-27 07:49:25,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:25,924 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-08-27 07:49:25,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:25,944 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-08-27 07:49:25,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:25,991 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-08-27 07:49:25,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:26,017 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 07:49:26,017 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 07:49:26,017 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1156250139] [2021-08-27 07:49:26,017 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1156250139] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 07:49:26,018 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 07:49:26,018 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2021-08-27 07:49:26,018 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1570368943] [2021-08-27 07:49:26,019 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2021-08-27 07:49:26,019 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 07:49:26,019 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-08-27 07:49:26,020 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=148, Unknown=0, NotChecked=0, Total=182 [2021-08-27 07:49:26,020 INFO L87 Difference]: Start difference. First operand 474 states and 580 transitions. Second operand has 14 states, 14 states have (on average 3.5) internal successors, (49), 7 states have internal predecessors, (49), 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-08-27 07:49:27,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 07:49:27,057 INFO L93 Difference]: Finished difference Result 515 states and 628 transitions. [2021-08-27 07:49:27,057 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-08-27 07:49:27,057 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 3.5) internal successors, (49), 7 states have internal predecessors, (49), 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 61 [2021-08-27 07:49:27,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 07:49:27,059 INFO L225 Difference]: With dead ends: 515 [2021-08-27 07:49:27,059 INFO L226 Difference]: Without dead ends: 496 [2021-08-27 07:49:27,059 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 208.6ms TimeCoverageRelationStatistics Valid=42, Invalid=198, Unknown=0, NotChecked=0, Total=240 [2021-08-27 07:49:27,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 496 states. [2021-08-27 07:49:27,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 496 to 469. [2021-08-27 07:49:27,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 469 states, 370 states have (on average 1.2297297297297298) internal successors, (455), 377 states have internal predecessors, (455), 55 states have call successors, (55), 41 states have call predecessors, (55), 43 states have return successors, (63), 51 states have call predecessors, (63), 49 states have call successors, (63) [2021-08-27 07:49:27,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 469 states to 469 states and 573 transitions. [2021-08-27 07:49:27,067 INFO L78 Accepts]: Start accepts. Automaton has 469 states and 573 transitions. Word has length 61 [2021-08-27 07:49:27,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 07:49:27,067 INFO L470 AbstractCegarLoop]: Abstraction has 469 states and 573 transitions. [2021-08-27 07:49:27,067 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 3.5) internal successors, (49), 7 states have internal predecessors, (49), 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-08-27 07:49:27,067 INFO L276 IsEmpty]: Start isEmpty. Operand 469 states and 573 transitions. [2021-08-27 07:49:27,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2021-08-27 07:49:27,068 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 07:49:27,068 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] [2021-08-27 07:49:27,069 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2021-08-27 07:49:27,069 INFO L402 AbstractCegarLoop]: === Iteration 29 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2021-08-27 07:49:27,069 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 07:49:27,069 INFO L82 PathProgramCache]: Analyzing trace with hash 1549264219, now seen corresponding path program 1 times [2021-08-27 07:49:27,069 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 07:49:27,070 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [472771639] [2021-08-27 07:49:27,070 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 07:49:27,070 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 07:49:27,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:27,190 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 07:49:27,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:27,223 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-08-27 07:49:27,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:27,242 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-08-27 07:49:27,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:27,263 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-08-27 07:49:27,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:27,325 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-08-27 07:49:27,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:27,352 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 07:49:27,353 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 07:49:27,353 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [472771639] [2021-08-27 07:49:27,353 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [472771639] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 07:49:27,353 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 07:49:27,353 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2021-08-27 07:49:27,353 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [724522790] [2021-08-27 07:49:27,354 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2021-08-27 07:49:27,354 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 07:49:27,354 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-08-27 07:49:27,354 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=148, Unknown=0, NotChecked=0, Total=182 [2021-08-27 07:49:27,355 INFO L87 Difference]: Start difference. First operand 469 states and 573 transitions. Second operand has 14 states, 14 states have (on average 3.5) internal successors, (49), 7 states have internal predecessors, (49), 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-08-27 07:49:28,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 07:49:28,355 INFO L93 Difference]: Finished difference Result 510 states and 621 transitions. [2021-08-27 07:49:28,356 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-08-27 07:49:28,356 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 3.5) internal successors, (49), 7 states have internal predecessors, (49), 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 61 [2021-08-27 07:49:28,356 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 07:49:28,357 INFO L225 Difference]: With dead ends: 510 [2021-08-27 07:49:28,357 INFO L226 Difference]: Without dead ends: 492 [2021-08-27 07:49:28,358 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 233.7ms TimeCoverageRelationStatistics Valid=42, Invalid=198, Unknown=0, NotChecked=0, Total=240 [2021-08-27 07:49:28,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 492 states. [2021-08-27 07:49:28,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 492 to 465. [2021-08-27 07:49:28,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 465 states, 367 states have (on average 1.228882833787466) internal successors, (451), 374 states have internal predecessors, (451), 54 states have call successors, (54), 41 states have call predecessors, (54), 43 states have return successors, (62), 50 states have call predecessors, (62), 48 states have call successors, (62) [2021-08-27 07:49:28,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 465 states to 465 states and 567 transitions. [2021-08-27 07:49:28,366 INFO L78 Accepts]: Start accepts. Automaton has 465 states and 567 transitions. Word has length 61 [2021-08-27 07:49:28,366 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 07:49:28,366 INFO L470 AbstractCegarLoop]: Abstraction has 465 states and 567 transitions. [2021-08-27 07:49:28,366 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 3.5) internal successors, (49), 7 states have internal predecessors, (49), 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-08-27 07:49:28,366 INFO L276 IsEmpty]: Start isEmpty. Operand 465 states and 567 transitions. [2021-08-27 07:49:28,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2021-08-27 07:49:28,367 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 07:49:28,367 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 07:49:28,368 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2021-08-27 07:49:28,368 INFO L402 AbstractCegarLoop]: === Iteration 30 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2021-08-27 07:49:28,368 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 07:49:28,368 INFO L82 PathProgramCache]: Analyzing trace with hash -1654833550, now seen corresponding path program 1 times [2021-08-27 07:49:28,368 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 07:49:28,369 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2115403502] [2021-08-27 07:49:28,369 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 07:49:28,369 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 07:49:28,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:28,486 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 07:49:28,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:28,517 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-08-27 07:49:28,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:28,533 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-08-27 07:49:28,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:28,545 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2021-08-27 07:49:28,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:28,567 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-08-27 07:49:28,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:28,573 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-08-27 07:49:28,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:28,585 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-08-27 07:49:28,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:28,588 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 07:49:28,588 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 07:49:28,588 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2115403502] [2021-08-27 07:49:28,588 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2115403502] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 07:49:28,589 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 07:49:28,589 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-08-27 07:49:28,589 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [276161355] [2021-08-27 07:49:28,590 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-08-27 07:49:28,590 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 07:49:28,590 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-08-27 07:49:28,590 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2021-08-27 07:49:28,591 INFO L87 Difference]: Start difference. First operand 465 states and 567 transitions. Second operand has 9 states, 9 states have (on average 5.333333333333333) internal successors, (48), 3 states have internal predecessors, (48), 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-08-27 07:49:29,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 07:49:29,382 INFO L93 Difference]: Finished difference Result 636 states and 773 transitions. [2021-08-27 07:49:29,383 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-08-27 07:49:29,383 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.333333333333333) internal successors, (48), 3 states have internal predecessors, (48), 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 67 [2021-08-27 07:49:29,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 07:49:29,384 INFO L225 Difference]: With dead ends: 636 [2021-08-27 07:49:29,384 INFO L226 Difference]: Without dead ends: 636 [2021-08-27 07:49:29,385 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 244.3ms TimeCoverageRelationStatistics Valid=57, Invalid=99, Unknown=0, NotChecked=0, Total=156 [2021-08-27 07:49:29,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 636 states. [2021-08-27 07:49:29,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 636 to 586. [2021-08-27 07:49:29,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 586 states, 460 states have (on average 1.2195652173913043) internal successors, (561), 469 states have internal predecessors, (561), 67 states have call successors, (67), 51 states have call predecessors, (67), 58 states have return successors, (87), 66 states have call predecessors, (87), 62 states have call successors, (87) [2021-08-27 07:49:29,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 586 states to 586 states and 715 transitions. [2021-08-27 07:49:29,393 INFO L78 Accepts]: Start accepts. Automaton has 586 states and 715 transitions. Word has length 67 [2021-08-27 07:49:29,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 07:49:29,393 INFO L470 AbstractCegarLoop]: Abstraction has 586 states and 715 transitions. [2021-08-27 07:49:29,394 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.333333333333333) internal successors, (48), 3 states have internal predecessors, (48), 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-08-27 07:49:29,394 INFO L276 IsEmpty]: Start isEmpty. Operand 586 states and 715 transitions. [2021-08-27 07:49:29,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2021-08-27 07:49:29,395 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 07:49:29,395 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] [2021-08-27 07:49:29,395 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2021-08-27 07:49:29,395 INFO L402 AbstractCegarLoop]: === Iteration 31 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2021-08-27 07:49:29,396 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 07:49:29,396 INFO L82 PathProgramCache]: Analyzing trace with hash 2014934282, now seen corresponding path program 1 times [2021-08-27 07:49:29,396 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 07:49:29,396 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1198593836] [2021-08-27 07:49:29,396 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 07:49:29,396 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 07:49:29,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:29,511 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 07:49:29,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:29,541 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-08-27 07:49:29,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:29,558 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-08-27 07:49:29,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:29,577 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-08-27 07:49:29,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:29,623 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2021-08-27 07:49:29,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:29,648 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 07:49:29,648 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 07:49:29,649 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1198593836] [2021-08-27 07:49:29,649 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1198593836] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 07:49:29,649 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 07:49:29,649 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2021-08-27 07:49:29,649 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1281187408] [2021-08-27 07:49:29,650 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2021-08-27 07:49:29,650 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 07:49:29,650 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-08-27 07:49:29,650 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=148, Unknown=0, NotChecked=0, Total=182 [2021-08-27 07:49:29,650 INFO L87 Difference]: Start difference. First operand 586 states and 715 transitions. Second operand has 14 states, 14 states have (on average 3.7857142857142856) internal successors, (53), 7 states have internal predecessors, (53), 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-08-27 07:49:30,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 07:49:30,818 INFO L93 Difference]: Finished difference Result 627 states and 764 transitions. [2021-08-27 07:49:30,818 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-08-27 07:49:30,819 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 3.7857142857142856) internal successors, (53), 7 states have internal predecessors, (53), 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 65 [2021-08-27 07:49:30,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 07:49:30,820 INFO L225 Difference]: With dead ends: 627 [2021-08-27 07:49:30,820 INFO L226 Difference]: Without dead ends: 587 [2021-08-27 07:49:30,821 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 206.0ms TimeCoverageRelationStatistics Valid=42, Invalid=198, Unknown=0, NotChecked=0, Total=240 [2021-08-27 07:49:30,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 587 states. [2021-08-27 07:49:30,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 587 to 560. [2021-08-27 07:49:30,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 560 states, 439 states have (on average 1.2186788154897494) internal successors, (535), 448 states have internal predecessors, (535), 64 states have call successors, (64), 49 states have call predecessors, (64), 56 states have return successors, (84), 63 states have call predecessors, (84), 59 states have call successors, (84) [2021-08-27 07:49:30,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 560 states to 560 states and 683 transitions. [2021-08-27 07:49:30,829 INFO L78 Accepts]: Start accepts. Automaton has 560 states and 683 transitions. Word has length 65 [2021-08-27 07:49:30,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 07:49:30,830 INFO L470 AbstractCegarLoop]: Abstraction has 560 states and 683 transitions. [2021-08-27 07:49:30,830 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 3.7857142857142856) internal successors, (53), 7 states have internal predecessors, (53), 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-08-27 07:49:30,830 INFO L276 IsEmpty]: Start isEmpty. Operand 560 states and 683 transitions. [2021-08-27 07:49:30,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2021-08-27 07:49:30,831 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 07:49:30,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 07:49:30,831 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2021-08-27 07:49:30,832 INFO L402 AbstractCegarLoop]: === Iteration 32 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2021-08-27 07:49:30,832 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 07:49:30,832 INFO L82 PathProgramCache]: Analyzing trace with hash 1554016619, now seen corresponding path program 1 times [2021-08-27 07:49:30,832 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 07:49:30,832 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [508603890] [2021-08-27 07:49:30,832 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 07:49:30,833 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 07:49:30,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:30,983 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 07:49:30,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:31,017 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-08-27 07:49:31,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:31,037 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-08-27 07:49:31,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:31,050 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2021-08-27 07:49:31,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:31,066 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-08-27 07:49:31,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:31,069 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-08-27 07:49:31,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:31,080 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-08-27 07:49:31,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:31,094 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2021-08-27 07:49:31,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:31,108 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 07:49:31,108 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 07:49:31,108 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [508603890] [2021-08-27 07:49:31,108 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [508603890] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 07:49:31,109 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 07:49:31,109 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-08-27 07:49:31,109 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [517281749] [2021-08-27 07:49:31,109 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-08-27 07:49:31,109 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 07:49:31,110 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-08-27 07:49:31,110 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2021-08-27 07:49:31,110 INFO L87 Difference]: Start difference. First operand 560 states and 683 transitions. Second operand has 12 states, 12 states have (on average 4.916666666666667) internal successors, (59), 6 states have internal predecessors, (59), 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-08-27 07:49:32,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 07:49:32,610 INFO L93 Difference]: Finished difference Result 575 states and 695 transitions. [2021-08-27 07:49:32,610 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2021-08-27 07:49:32,610 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 4.916666666666667) internal successors, (59), 6 states have internal predecessors, (59), 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 79 [2021-08-27 07:49:32,611 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 07:49:32,612 INFO L225 Difference]: With dead ends: 575 [2021-08-27 07:49:32,612 INFO L226 Difference]: Without dead ends: 575 [2021-08-27 07:49:32,612 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 107 ImplicationChecksByTransitivity, 697.6ms TimeCoverageRelationStatistics Valid=204, Invalid=498, Unknown=0, NotChecked=0, Total=702 [2021-08-27 07:49:32,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 575 states. [2021-08-27 07:49:32,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 575 to 542. [2021-08-27 07:49:32,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 542 states, 425 states have (on average 1.2188235294117646) internal successors, (518), 433 states have internal predecessors, (518), 62 states have call successors, (62), 49 states have call predecessors, (62), 54 states have return successors, (73), 60 states have call predecessors, (73), 57 states have call successors, (73) [2021-08-27 07:49:32,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 542 states to 542 states and 653 transitions. [2021-08-27 07:49:32,621 INFO L78 Accepts]: Start accepts. Automaton has 542 states and 653 transitions. Word has length 79 [2021-08-27 07:49:32,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 07:49:32,621 INFO L470 AbstractCegarLoop]: Abstraction has 542 states and 653 transitions. [2021-08-27 07:49:32,621 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 4.916666666666667) internal successors, (59), 6 states have internal predecessors, (59), 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-08-27 07:49:32,621 INFO L276 IsEmpty]: Start isEmpty. Operand 542 states and 653 transitions. [2021-08-27 07:49:32,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2021-08-27 07:49:32,623 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 07:49:32,623 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] [2021-08-27 07:49:32,623 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2021-08-27 07:49:32,623 INFO L402 AbstractCegarLoop]: === Iteration 33 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2021-08-27 07:49:32,623 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 07:49:32,624 INFO L82 PathProgramCache]: Analyzing trace with hash -478221177, now seen corresponding path program 1 times [2021-08-27 07:49:32,624 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 07:49:32,624 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1395423849] [2021-08-27 07:49:32,624 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 07:49:32,624 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 07:49:32,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:32,759 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 07:49:32,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:32,790 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-08-27 07:49:32,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:32,808 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-08-27 07:49:32,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:32,821 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2021-08-27 07:49:32,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:32,863 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-08-27 07:49:32,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:32,866 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-08-27 07:49:32,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:32,879 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-08-27 07:49:32,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:32,895 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2021-08-27 07:49:32,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:32,910 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-08-27 07:49:32,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:32,913 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 07:49:32,913 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 07:49:32,913 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1395423849] [2021-08-27 07:49:32,913 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1395423849] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 07:49:32,913 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 07:49:32,913 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2021-08-27 07:49:32,914 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [236672131] [2021-08-27 07:49:32,914 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2021-08-27 07:49:32,914 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 07:49:32,914 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-08-27 07:49:32,915 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=133, Unknown=0, NotChecked=0, Total=182 [2021-08-27 07:49:32,915 INFO L87 Difference]: Start difference. First operand 542 states and 653 transitions. Second operand has 14 states, 14 states have (on average 4.071428571428571) internal successors, (57), 5 states have internal predecessors, (57), 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-08-27 07:49:33,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 07:49:33,855 INFO L93 Difference]: Finished difference Result 651 states and 821 transitions. [2021-08-27 07:49:33,856 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2021-08-27 07:49:33,856 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 4.071428571428571) internal successors, (57), 5 states have internal predecessors, (57), 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 80 [2021-08-27 07:49:33,856 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 07:49:33,857 INFO L225 Difference]: With dead ends: 651 [2021-08-27 07:49:33,857 INFO L226 Difference]: Without dead ends: 651 [2021-08-27 07:49:33,858 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 360.1ms TimeCoverageRelationStatistics Valid=115, Invalid=391, Unknown=0, NotChecked=0, Total=506 [2021-08-27 07:49:33,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 651 states. [2021-08-27 07:49:33,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 651 to 506. [2021-08-27 07:49:33,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 506 states, 401 states have (on average 1.2194513715710724) internal successors, (489), 407 states have internal predecessors, (489), 55 states have call successors, (55), 43 states have call predecessors, (55), 49 states have return successors, (63), 56 states have call predecessors, (63), 51 states have call successors, (63) [2021-08-27 07:49:33,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 506 states to 506 states and 607 transitions. [2021-08-27 07:49:33,866 INFO L78 Accepts]: Start accepts. Automaton has 506 states and 607 transitions. Word has length 80 [2021-08-27 07:49:33,866 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 07:49:33,866 INFO L470 AbstractCegarLoop]: Abstraction has 506 states and 607 transitions. [2021-08-27 07:49:33,867 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 4.071428571428571) internal successors, (57), 5 states have internal predecessors, (57), 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-08-27 07:49:33,867 INFO L276 IsEmpty]: Start isEmpty. Operand 506 states and 607 transitions. [2021-08-27 07:49:33,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2021-08-27 07:49:33,868 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 07:49:33,868 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] [2021-08-27 07:49:33,868 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2021-08-27 07:49:33,868 INFO L402 AbstractCegarLoop]: === Iteration 34 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2021-08-27 07:49:33,869 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 07:49:33,869 INFO L82 PathProgramCache]: Analyzing trace with hash -998039197, now seen corresponding path program 1 times [2021-08-27 07:49:33,869 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 07:49:33,869 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [563725663] [2021-08-27 07:49:33,869 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 07:49:33,869 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 07:49:33,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:33,991 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 07:49:33,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:34,043 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-08-27 07:49:34,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:34,061 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-08-27 07:49:34,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:34,082 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-08-27 07:49:34,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:34,134 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-08-27 07:49:34,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:34,188 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-08-27 07:49:34,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:34,191 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-08-27 07:49:34,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:34,206 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-08-27 07:49:34,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:34,209 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2021-08-27 07:49:34,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:34,211 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 07:49:34,211 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 07:49:34,212 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [563725663] [2021-08-27 07:49:34,212 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [563725663] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 07:49:34,212 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 07:49:34,212 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2021-08-27 07:49:34,212 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1741173861] [2021-08-27 07:49:34,213 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2021-08-27 07:49:34,213 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 07:49:34,213 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-08-27 07:49:34,213 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=192, Unknown=0, NotChecked=0, Total=240 [2021-08-27 07:49:34,213 INFO L87 Difference]: Start difference. First operand 506 states and 607 transitions. Second operand has 16 states, 16 states have (on average 4.0625) internal successors, (65), 7 states have internal predecessors, (65), 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-08-27 07:49:35,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 07:49:35,344 INFO L93 Difference]: Finished difference Result 581 states and 696 transitions. [2021-08-27 07:49:35,345 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2021-08-27 07:49:35,345 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 4.0625) internal successors, (65), 7 states have internal predecessors, (65), 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 85 [2021-08-27 07:49:35,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 07:49:35,346 INFO L225 Difference]: With dead ends: 581 [2021-08-27 07:49:35,347 INFO L226 Difference]: Without dead ends: 563 [2021-08-27 07:49:35,347 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 417.0ms TimeCoverageRelationStatistics Valid=101, Invalid=499, Unknown=0, NotChecked=0, Total=600 [2021-08-27 07:49:35,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 563 states. [2021-08-27 07:49:35,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 563 to 514. [2021-08-27 07:49:35,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 514 states, 408 states have (on average 1.2156862745098038) internal successors, (496), 414 states have internal predecessors, (496), 55 states have call successors, (55), 43 states have call predecessors, (55), 50 states have return successors, (66), 57 states have call predecessors, (66), 51 states have call successors, (66) [2021-08-27 07:49:35,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 514 states to 514 states and 617 transitions. [2021-08-27 07:49:35,354 INFO L78 Accepts]: Start accepts. Automaton has 514 states and 617 transitions. Word has length 85 [2021-08-27 07:49:35,354 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 07:49:35,354 INFO L470 AbstractCegarLoop]: Abstraction has 514 states and 617 transitions. [2021-08-27 07:49:35,354 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 4.0625) internal successors, (65), 7 states have internal predecessors, (65), 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-08-27 07:49:35,354 INFO L276 IsEmpty]: Start isEmpty. Operand 514 states and 617 transitions. [2021-08-27 07:49:35,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2021-08-27 07:49:35,355 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 07:49:35,355 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] [2021-08-27 07:49:35,356 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2021-08-27 07:49:35,356 INFO L402 AbstractCegarLoop]: === Iteration 35 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2021-08-27 07:49:35,356 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 07:49:35,356 INFO L82 PathProgramCache]: Analyzing trace with hash 2056891224, now seen corresponding path program 1 times [2021-08-27 07:49:35,356 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 07:49:35,357 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [209376273] [2021-08-27 07:49:35,357 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 07:49:35,357 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 07:49:35,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:35,467 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 07:49:35,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:35,497 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-08-27 07:49:35,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:35,514 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-08-27 07:49:35,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:35,534 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-08-27 07:49:35,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:35,574 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2021-08-27 07:49:35,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:35,589 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-08-27 07:49:35,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:35,612 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2021-08-27 07:49:35,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:35,628 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 07:49:35,629 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 07:49:35,629 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [209376273] [2021-08-27 07:49:35,629 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [209376273] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 07:49:35,629 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 07:49:35,629 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-08-27 07:49:35,629 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1783653745] [2021-08-27 07:49:35,630 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-08-27 07:49:35,630 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 07:49:35,630 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-08-27 07:49:35,631 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2021-08-27 07:49:35,631 INFO L87 Difference]: Start difference. First operand 514 states and 617 transitions. Second operand has 12 states, 12 states have (on average 5.333333333333333) internal successors, (64), 5 states have internal predecessors, (64), 5 states have call successors, (9), 9 states have call predecessors, (9), 3 states have return successors, (7), 5 states have call predecessors, (7), 4 states have call successors, (7) [2021-08-27 07:49:36,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 07:49:36,832 INFO L93 Difference]: Finished difference Result 667 states and 781 transitions. [2021-08-27 07:49:36,832 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-08-27 07:49:36,832 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 5.333333333333333) internal successors, (64), 5 states have internal predecessors, (64), 5 states have call successors, (9), 9 states have call predecessors, (9), 3 states have return successors, (7), 5 states have call predecessors, (7), 4 states have call successors, (7) Word has length 80 [2021-08-27 07:49:36,833 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 07:49:36,834 INFO L225 Difference]: With dead ends: 667 [2021-08-27 07:49:36,834 INFO L226 Difference]: Without dead ends: 667 [2021-08-27 07:49:36,835 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 389.2ms TimeCoverageRelationStatistics Valid=124, Invalid=338, Unknown=0, NotChecked=0, Total=462 [2021-08-27 07:49:36,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 667 states. [2021-08-27 07:49:36,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 667 to 635. [2021-08-27 07:49:36,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 635 states, 505 states have (on average 1.205940594059406) internal successors, (609), 513 states have internal predecessors, (609), 63 states have call successors, (63), 55 states have call predecessors, (63), 66 states have return successors, (77), 67 states have call predecessors, (77), 59 states have call successors, (77) [2021-08-27 07:49:36,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 635 states to 635 states and 749 transitions. [2021-08-27 07:49:36,843 INFO L78 Accepts]: Start accepts. Automaton has 635 states and 749 transitions. Word has length 80 [2021-08-27 07:49:36,844 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 07:49:36,844 INFO L470 AbstractCegarLoop]: Abstraction has 635 states and 749 transitions. [2021-08-27 07:49:36,844 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 5.333333333333333) internal successors, (64), 5 states have internal predecessors, (64), 5 states have call successors, (9), 9 states have call predecessors, (9), 3 states have return successors, (7), 5 states have call predecessors, (7), 4 states have call successors, (7) [2021-08-27 07:49:36,844 INFO L276 IsEmpty]: Start isEmpty. Operand 635 states and 749 transitions. [2021-08-27 07:49:36,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2021-08-27 07:49:36,845 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 07:49:36,845 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08-27 07:49:36,846 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2021-08-27 07:49:36,846 INFO L402 AbstractCegarLoop]: === Iteration 36 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2021-08-27 07:49:36,846 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 07:49:36,846 INFO L82 PathProgramCache]: Analyzing trace with hash -1814178751, now seen corresponding path program 1 times [2021-08-27 07:49:36,846 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 07:49:36,847 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1888642556] [2021-08-27 07:49:36,847 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 07:49:36,847 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 07:49:36,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:36,967 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 07:49:36,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:37,046 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-08-27 07:49:37,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:37,074 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-08-27 07:49:37,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:37,097 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-08-27 07:49:37,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:37,155 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-08-27 07:49:37,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:37,206 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-08-27 07:49:37,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:37,210 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-08-27 07:49:37,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:37,224 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-08-27 07:49:37,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:37,227 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2021-08-27 07:49:37,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:37,230 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 07:49:37,230 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 07:49:37,230 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1888642556] [2021-08-27 07:49:37,231 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1888642556] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 07:49:37,231 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 07:49:37,231 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2021-08-27 07:49:37,231 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2108749754] [2021-08-27 07:49:37,231 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2021-08-27 07:49:37,231 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 07:49:37,232 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-08-27 07:49:37,232 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=192, Unknown=0, NotChecked=0, Total=240 [2021-08-27 07:49:37,232 INFO L87 Difference]: Start difference. First operand 635 states and 749 transitions. Second operand has 16 states, 16 states have (on average 4.125) internal successors, (66), 7 states have internal predecessors, (66), 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-08-27 07:49:38,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 07:49:38,457 INFO L93 Difference]: Finished difference Result 682 states and 798 transitions. [2021-08-27 07:49:38,457 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-08-27 07:49:38,457 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 4.125) internal successors, (66), 7 states have internal predecessors, (66), 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 86 [2021-08-27 07:49:38,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 07:49:38,459 INFO L225 Difference]: With dead ends: 682 [2021-08-27 07:49:38,459 INFO L226 Difference]: Without dead ends: 664 [2021-08-27 07:49:38,459 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 353.5ms TimeCoverageRelationStatistics Valid=78, Invalid=342, Unknown=0, NotChecked=0, Total=420 [2021-08-27 07:49:38,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 664 states. [2021-08-27 07:49:38,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 664 to 627. [2021-08-27 07:49:38,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 627 states, 498 states have (on average 1.2068273092369477) internal successors, (601), 506 states have internal predecessors, (601), 63 states have call successors, (63), 55 states have call predecessors, (63), 65 states have return successors, (75), 66 states have call predecessors, (75), 59 states have call successors, (75) [2021-08-27 07:49:38,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 627 states to 627 states and 739 transitions. [2021-08-27 07:49:38,469 INFO L78 Accepts]: Start accepts. Automaton has 627 states and 739 transitions. Word has length 86 [2021-08-27 07:49:38,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 07:49:38,469 INFO L470 AbstractCegarLoop]: Abstraction has 627 states and 739 transitions. [2021-08-27 07:49:38,469 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 4.125) internal successors, (66), 7 states have internal predecessors, (66), 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-08-27 07:49:38,470 INFO L276 IsEmpty]: Start isEmpty. Operand 627 states and 739 transitions. [2021-08-27 07:49:38,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2021-08-27 07:49:38,471 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 07:49:38,471 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] [2021-08-27 07:49:38,471 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2021-08-27 07:49:38,471 INFO L402 AbstractCegarLoop]: === Iteration 37 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2021-08-27 07:49:38,472 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 07:49:38,472 INFO L82 PathProgramCache]: Analyzing trace with hash -1760569352, now seen corresponding path program 1 times [2021-08-27 07:49:38,472 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 07:49:38,472 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1793147380] [2021-08-27 07:49:38,472 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 07:49:38,472 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 07:49:38,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:38,582 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 07:49:38,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:38,608 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-08-27 07:49:38,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:38,625 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-08-27 07:49:38,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:38,672 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-08-27 07:49:38,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:38,707 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2021-08-27 07:49:38,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:38,733 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-08-27 07:49:38,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:38,758 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2021-08-27 07:49:38,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:38,763 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 07:49:38,763 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 07:49:38,763 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1793147380] [2021-08-27 07:49:38,763 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1793147380] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 07:49:38,763 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 07:49:38,763 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-08-27 07:49:38,764 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1026143652] [2021-08-27 07:49:38,764 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-08-27 07:49:38,764 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 07:49:38,764 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-08-27 07:49:38,765 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2021-08-27 07:49:38,765 INFO L87 Difference]: Start difference. First operand 627 states and 739 transitions. Second operand has 10 states, 10 states have (on average 6.5) internal successors, (65), 3 states have internal predecessors, (65), 3 states have call successors, (9), 9 states have call predecessors, (9), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2021-08-27 07:49:39,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 07:49:39,621 INFO L93 Difference]: Finished difference Result 634 states and 743 transitions. [2021-08-27 07:49:39,622 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-08-27 07:49:39,622 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.5) internal successors, (65), 3 states have internal predecessors, (65), 3 states have call successors, (9), 9 states have call predecessors, (9), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 81 [2021-08-27 07:49:39,622 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 07:49:39,624 INFO L225 Difference]: With dead ends: 634 [2021-08-27 07:49:39,624 INFO L226 Difference]: Without dead ends: 581 [2021-08-27 07:49:39,624 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 322.6ms TimeCoverageRelationStatistics Valid=80, Invalid=160, Unknown=0, NotChecked=0, Total=240 [2021-08-27 07:49:39,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 581 states. [2021-08-27 07:49:39,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 581 to 579. [2021-08-27 07:49:39,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 579 states, 456 states have (on average 1.206140350877193) internal successors, (550), 464 states have internal predecessors, (550), 61 states have call successors, (61), 53 states have call predecessors, (61), 61 states have return successors, (71), 62 states have call predecessors, (71), 57 states have call successors, (71) [2021-08-27 07:49:39,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 579 states to 579 states and 682 transitions. [2021-08-27 07:49:39,633 INFO L78 Accepts]: Start accepts. Automaton has 579 states and 682 transitions. Word has length 81 [2021-08-27 07:49:39,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 07:49:39,633 INFO L470 AbstractCegarLoop]: Abstraction has 579 states and 682 transitions. [2021-08-27 07:49:39,633 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.5) internal successors, (65), 3 states have internal predecessors, (65), 3 states have call successors, (9), 9 states have call predecessors, (9), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2021-08-27 07:49:39,633 INFO L276 IsEmpty]: Start isEmpty. Operand 579 states and 682 transitions. [2021-08-27 07:49:39,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2021-08-27 07:49:39,634 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 07:49:39,635 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 07:49:39,635 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2021-08-27 07:49:39,635 INFO L402 AbstractCegarLoop]: === Iteration 38 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2021-08-27 07:49:39,635 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 07:49:39,635 INFO L82 PathProgramCache]: Analyzing trace with hash 1681688182, now seen corresponding path program 1 times [2021-08-27 07:49:39,636 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 07:49:39,636 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [135956319] [2021-08-27 07:49:39,636 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 07:49:39,636 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 07:49:39,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:39,756 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 07:49:39,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:39,792 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-08-27 07:49:39,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:39,807 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-08-27 07:49:39,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:39,827 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-08-27 07:49:39,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:39,880 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2021-08-27 07:49:39,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:39,885 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-08-27 07:49:39,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:39,901 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2021-08-27 07:49:39,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:39,919 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2021-08-27 07:49:39,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:39,955 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 07:49:39,956 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 07:49:39,956 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [135956319] [2021-08-27 07:49:39,956 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [135956319] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 07:49:39,956 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 07:49:39,956 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2021-08-27 07:49:39,957 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [940120524] [2021-08-27 07:49:39,957 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2021-08-27 07:49:39,957 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 07:49:39,957 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-08-27 07:49:39,958 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=196, Unknown=0, NotChecked=0, Total=240 [2021-08-27 07:49:39,958 INFO L87 Difference]: Start difference. First operand 579 states and 682 transitions. Second operand has 16 states, 16 states have (on average 4.5) internal successors, (72), 7 states have internal predecessors, (72), 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-08-27 07:49:41,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 07:49:41,165 INFO L93 Difference]: Finished difference Result 580 states and 682 transitions. [2021-08-27 07:49:41,165 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-08-27 07:49:41,166 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 4.5) internal successors, (72), 7 states have internal predecessors, (72), 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 90 [2021-08-27 07:49:41,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 07:49:41,167 INFO L225 Difference]: With dead ends: 580 [2021-08-27 07:49:41,167 INFO L226 Difference]: Without dead ends: 495 [2021-08-27 07:49:41,167 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 312.2ms TimeCoverageRelationStatistics Valid=81, Invalid=381, Unknown=0, NotChecked=0, Total=462 [2021-08-27 07:49:41,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 495 states. [2021-08-27 07:49:41,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 495 to 493. [2021-08-27 07:49:41,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 493 states, 384 states have (on average 1.2083333333333333) internal successors, (464), 391 states have internal predecessors, (464), 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-08-27 07:49:41,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 493 states to 493 states and 582 transitions. [2021-08-27 07:49:41,174 INFO L78 Accepts]: Start accepts. Automaton has 493 states and 582 transitions. Word has length 90 [2021-08-27 07:49:41,174 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 07:49:41,174 INFO L470 AbstractCegarLoop]: Abstraction has 493 states and 582 transitions. [2021-08-27 07:49:41,175 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 4.5) internal successors, (72), 7 states have internal predecessors, (72), 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-08-27 07:49:41,175 INFO L276 IsEmpty]: Start isEmpty. Operand 493 states and 582 transitions. [2021-08-27 07:49:41,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2021-08-27 07:49:41,176 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 07:49:41,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08-27 07:49:41,176 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2021-08-27 07:49:41,176 INFO L402 AbstractCegarLoop]: === Iteration 39 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2021-08-27 07:49:41,177 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 07:49:41,177 INFO L82 PathProgramCache]: Analyzing trace with hash 1266916623, now seen corresponding path program 1 times [2021-08-27 07:49:41,177 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 07:49:41,177 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [325816554] [2021-08-27 07:49:41,177 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 07:49:41,177 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 07:49:41,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:41,281 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 07:49:41,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:41,307 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-08-27 07:49:41,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:41,325 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-08-27 07:49:41,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:41,341 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-08-27 07:49:41,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:41,390 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-08-27 07:49:41,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:41,426 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-08-27 07:49:41,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:41,430 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-08-27 07:49:41,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:41,442 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-08-27 07:49:41,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:41,458 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2021-08-27 07:49:41,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:41,461 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2021-08-27 07:49:41,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:41,464 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 07:49:41,464 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 07:49:41,464 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [325816554] [2021-08-27 07:49:41,465 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [325816554] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 07:49:41,465 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 07:49:41,465 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2021-08-27 07:49:41,465 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1905001578] [2021-08-27 07:49:41,465 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2021-08-27 07:49:41,466 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 07:49:41,466 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-08-27 07:49:41,466 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=132, Unknown=0, NotChecked=0, Total=182 [2021-08-27 07:49:41,466 INFO L87 Difference]: Start difference. First operand 493 states and 582 transitions. Second operand has 14 states, 14 states have (on average 5.285714285714286) internal successors, (74), 5 states have internal predecessors, (74), 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-08-27 07:49:41,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 07:49:41,859 INFO L93 Difference]: Finished difference Result 491 states and 577 transitions. [2021-08-27 07:49:41,860 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-08-27 07:49:41,860 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 5.285714285714286) internal successors, (74), 5 states have internal predecessors, (74), 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 96 [2021-08-27 07:49:41,860 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 07:49:41,861 INFO L225 Difference]: With dead ends: 491 [2021-08-27 07:49:41,861 INFO L226 Difference]: Without dead ends: 489 [2021-08-27 07:49:41,862 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 205.1ms TimeCoverageRelationStatistics Valid=64, Invalid=176, Unknown=0, NotChecked=0, Total=240 [2021-08-27 07:49:41,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 489 states. [2021-08-27 07:49:41,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 489 to 436. [2021-08-27 07:49:41,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 436 states, 340 states have (on average 1.1970588235294117) internal successors, (407), 346 states have internal predecessors, (407), 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-08-27 07:49:41,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 436 states to 436 states and 509 transitions. [2021-08-27 07:49:41,869 INFO L78 Accepts]: Start accepts. Automaton has 436 states and 509 transitions. Word has length 96 [2021-08-27 07:49:41,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 07:49:41,869 INFO L470 AbstractCegarLoop]: Abstraction has 436 states and 509 transitions. [2021-08-27 07:49:41,870 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 5.285714285714286) internal successors, (74), 5 states have internal predecessors, (74), 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-08-27 07:49:41,870 INFO L276 IsEmpty]: Start isEmpty. Operand 436 states and 509 transitions. [2021-08-27 07:49:41,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2021-08-27 07:49:41,871 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 07:49:41,871 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] [2021-08-27 07:49:41,871 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2021-08-27 07:49:41,872 INFO L402 AbstractCegarLoop]: === Iteration 40 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2021-08-27 07:49:41,872 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 07:49:41,872 INFO L82 PathProgramCache]: Analyzing trace with hash -596239754, now seen corresponding path program 1 times [2021-08-27 07:49:41,872 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 07:49:41,872 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2140884431] [2021-08-27 07:49:41,872 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 07:49:41,873 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 07:49:41,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:41,985 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 07:49:41,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:42,036 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-08-27 07:49:42,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:42,057 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-08-27 07:49:42,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:42,085 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-08-27 07:49:42,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:42,136 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-08-27 07:49:42,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:42,153 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-08-27 07:49:42,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:42,156 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-08-27 07:49:42,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:42,169 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-08-27 07:49:42,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:42,187 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2021-08-27 07:49:42,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:42,191 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2021-08-27 07:49:42,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:42,194 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 07:49:42,194 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 07:49:42,194 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2140884431] [2021-08-27 07:49:42,194 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2140884431] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 07:49:42,195 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 07:49:42,195 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2021-08-27 07:49:42,195 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [666730691] [2021-08-27 07:49:42,195 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2021-08-27 07:49:42,195 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 07:49:42,196 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-08-27 07:49:42,196 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=158, Unknown=0, NotChecked=0, Total=210 [2021-08-27 07:49:42,196 INFO L87 Difference]: Start difference. First operand 436 states and 509 transitions. Second operand has 15 states, 15 states have (on average 4.933333333333334) internal successors, (74), 6 states have internal predecessors, (74), 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-08-27 07:49:43,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 07:49:43,385 INFO L93 Difference]: Finished difference Result 833 states and 977 transitions. [2021-08-27 07:49:43,385 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2021-08-27 07:49:43,386 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 4.933333333333334) internal successors, (74), 6 states have internal predecessors, (74), 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 96 [2021-08-27 07:49:43,386 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 07:49:43,387 INFO L225 Difference]: With dead ends: 833 [2021-08-27 07:49:43,387 INFO L226 Difference]: Without dead ends: 791 [2021-08-27 07:49:43,388 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 116 ImplicationChecksByTransitivity, 470.9ms TimeCoverageRelationStatistics Valid=167, Invalid=589, Unknown=0, NotChecked=0, Total=756 [2021-08-27 07:49:43,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 791 states. [2021-08-27 07:49:43,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 791 to 416. [2021-08-27 07:49:43,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 416 states, 324 states have (on average 1.1975308641975309) internal successors, (388), 329 states have internal predecessors, (388), 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-08-27 07:49:43,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 416 states to 416 states and 484 transitions. [2021-08-27 07:49:43,396 INFO L78 Accepts]: Start accepts. Automaton has 416 states and 484 transitions. Word has length 96 [2021-08-27 07:49:43,396 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 07:49:43,396 INFO L470 AbstractCegarLoop]: Abstraction has 416 states and 484 transitions. [2021-08-27 07:49:43,396 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 4.933333333333334) internal successors, (74), 6 states have internal predecessors, (74), 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-08-27 07:49:43,396 INFO L276 IsEmpty]: Start isEmpty. Operand 416 states and 484 transitions. [2021-08-27 07:49:43,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2021-08-27 07:49:43,397 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 07:49:43,397 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] [2021-08-27 07:49:43,398 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2021-08-27 07:49:43,398 INFO L402 AbstractCegarLoop]: === Iteration 41 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2021-08-27 07:49:43,398 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 07:49:43,398 INFO L82 PathProgramCache]: Analyzing trace with hash -693188859, now seen corresponding path program 1 times [2021-08-27 07:49:43,398 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 07:49:43,398 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1824495374] [2021-08-27 07:49:43,399 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 07:49:43,399 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 07:49:43,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:43,526 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 07:49:43,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:43,558 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-08-27 07:49:43,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:43,575 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-08-27 07:49:43,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:43,596 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-08-27 07:49:43,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:43,668 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2021-08-27 07:49:43,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:43,727 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-08-27 07:49:43,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:43,744 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-08-27 07:49:43,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:43,747 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-08-27 07:49:43,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:43,764 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-08-27 07:49:43,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:43,784 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2021-08-27 07:49:43,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:43,802 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-08-27 07:49:43,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:43,806 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2021-08-27 07:49:43,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:43,813 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 07:49:43,813 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 07:49:43,814 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1824495374] [2021-08-27 07:49:43,814 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1824495374] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 07:49:43,814 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 07:49:43,814 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2021-08-27 07:49:43,814 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1354966721] [2021-08-27 07:49:43,815 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2021-08-27 07:49:43,815 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 07:49:43,815 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-08-27 07:49:43,815 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=269, Unknown=0, NotChecked=0, Total=342 [2021-08-27 07:49:43,815 INFO L87 Difference]: Start difference. First operand 416 states and 484 transitions. Second operand has 19 states, 19 states have (on average 3.9473684210526314) internal successors, (75), 7 states have internal predecessors, (75), 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-08-27 07:49:44,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 07:49:44,499 INFO L93 Difference]: Finished difference Result 461 states and 538 transitions. [2021-08-27 07:49:44,500 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-08-27 07:49:44,500 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 3.9473684210526314) internal successors, (75), 7 states have internal predecessors, (75), 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 101 [2021-08-27 07:49:44,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 07:49:44,502 INFO L225 Difference]: With dead ends: 461 [2021-08-27 07:49:44,502 INFO L226 Difference]: Without dead ends: 435 [2021-08-27 07:49:44,502 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 350.7ms TimeCoverageRelationStatistics Valid=114, Invalid=438, Unknown=0, NotChecked=0, Total=552 [2021-08-27 07:49:44,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 435 states. [2021-08-27 07:49:44,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 435 to 425. [2021-08-27 07:49:44,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 425 states, 332 states have (on average 1.1837349397590362) internal successors, (393), 338 states have internal predecessors, (393), 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-08-27 07:49:44,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 425 states to 425 states and 490 transitions. [2021-08-27 07:49:44,509 INFO L78 Accepts]: Start accepts. Automaton has 425 states and 490 transitions. Word has length 101 [2021-08-27 07:49:44,509 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 07:49:44,510 INFO L470 AbstractCegarLoop]: Abstraction has 425 states and 490 transitions. [2021-08-27 07:49:44,510 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 3.9473684210526314) internal successors, (75), 7 states have internal predecessors, (75), 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-08-27 07:49:44,510 INFO L276 IsEmpty]: Start isEmpty. Operand 425 states and 490 transitions. [2021-08-27 07:49:44,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2021-08-27 07:49:44,511 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 07:49:44,511 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] [2021-08-27 07:49:44,511 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2021-08-27 07:49:44,512 INFO L402 AbstractCegarLoop]: === Iteration 42 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2021-08-27 07:49:44,512 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 07:49:44,512 INFO L82 PathProgramCache]: Analyzing trace with hash 1496072861, now seen corresponding path program 1 times [2021-08-27 07:49:44,512 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 07:49:44,512 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1649302605] [2021-08-27 07:49:44,513 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 07:49:44,513 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 07:49:44,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:44,630 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 07:49:44,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:44,658 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-08-27 07:49:44,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:44,673 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-08-27 07:49:44,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:44,684 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2021-08-27 07:49:44,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:44,693 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-08-27 07:49:44,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:44,697 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-08-27 07:49:44,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:44,706 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-08-27 07:49:44,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:44,728 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2021-08-27 07:49:44,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:44,774 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-08-27 07:49:44,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:44,777 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2021-08-27 07:49:44,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:44,823 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-08-27 07:49:44,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:44,826 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-08-27 07:49:44,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:44,829 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-08-27 07:49:44,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:44,831 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2021-08-27 07:49:44,831 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 07:49:44,831 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1649302605] [2021-08-27 07:49:44,831 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1649302605] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 07:49:44,831 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 07:49:44,831 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2021-08-27 07:49:44,832 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [979840247] [2021-08-27 07:49:44,832 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2021-08-27 07:49:44,832 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 07:49:44,832 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-08-27 07:49:44,832 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=133, Unknown=0, NotChecked=0, Total=182 [2021-08-27 07:49:44,833 INFO L87 Difference]: Start difference. First operand 425 states and 490 transitions. Second operand has 14 states, 14 states have (on average 4.785714285714286) internal successors, (67), 5 states have internal predecessors, (67), 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-08-27 07:49:45,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 07:49:45,387 INFO L93 Difference]: Finished difference Result 376 states and 423 transitions. [2021-08-27 07:49:45,388 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-08-27 07:49:45,388 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 4.785714285714286) internal successors, (67), 5 states have internal predecessors, (67), 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 110 [2021-08-27 07:49:45,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 07:49:45,389 INFO L225 Difference]: With dead ends: 376 [2021-08-27 07:49:45,389 INFO L226 Difference]: Without dead ends: 376 [2021-08-27 07:49:45,389 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 233.0ms TimeCoverageRelationStatistics Valid=75, Invalid=231, Unknown=0, NotChecked=0, Total=306 [2021-08-27 07:49:45,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 376 states. [2021-08-27 07:49:45,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 376 to 242. [2021-08-27 07:49:45,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 242 states, 189 states have (on average 1.1428571428571428) internal successors, (216), 191 states have internal predecessors, (216), 26 states have call successors, (26), 26 states have call predecessors, (26), 26 states have return successors, (26), 24 states have call predecessors, (26), 24 states have call successors, (26) [2021-08-27 07:49:45,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 242 states to 242 states and 268 transitions. [2021-08-27 07:49:45,392 INFO L78 Accepts]: Start accepts. Automaton has 242 states and 268 transitions. Word has length 110 [2021-08-27 07:49:45,392 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 07:49:45,392 INFO L470 AbstractCegarLoop]: Abstraction has 242 states and 268 transitions. [2021-08-27 07:49:45,393 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 4.785714285714286) internal successors, (67), 5 states have internal predecessors, (67), 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-08-27 07:49:45,393 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 268 transitions. [2021-08-27 07:49:45,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2021-08-27 07:49:45,393 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 07:49:45,393 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] [2021-08-27 07:49:45,393 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2021-08-27 07:49:45,394 INFO L402 AbstractCegarLoop]: === Iteration 43 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2021-08-27 07:49:45,394 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 07:49:45,394 INFO L82 PathProgramCache]: Analyzing trace with hash -1225581856, now seen corresponding path program 1 times [2021-08-27 07:49:45,394 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 07:49:45,394 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1299016569] [2021-08-27 07:49:45,394 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 07:49:45,394 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 07:49:45,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:45,498 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 07:49:45,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:45,523 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-08-27 07:49:45,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:45,535 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-08-27 07:49:45,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:45,551 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-08-27 07:49:45,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:45,591 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2021-08-27 07:49:45,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:45,629 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-08-27 07:49:45,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:45,640 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-08-27 07:49:45,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:45,658 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-08-27 07:49:45,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:45,670 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-08-27 07:49:45,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:45,686 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2021-08-27 07:49:45,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:45,699 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-08-27 07:49:45,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:45,701 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2021-08-27 07:49:45,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:45,722 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2021-08-27 07:49:45,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:45,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-08-27 07:49:45,725 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 07:49:45,726 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1299016569] [2021-08-27 07:49:45,726 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1299016569] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 07:49:45,726 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 07:49:45,726 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2021-08-27 07:49:45,726 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [41890845] [2021-08-27 07:49:45,726 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2021-08-27 07:49:45,726 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 07:49:45,727 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-08-27 07:49:45,727 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=145, Unknown=0, NotChecked=0, Total=210 [2021-08-27 07:49:45,727 INFO L87 Difference]: Start difference. First operand 242 states and 268 transitions. Second operand has 15 states, 15 states have (on average 5.933333333333334) internal successors, (89), 4 states have internal predecessors, (89), 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-08-27 07:49:46,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 07:49:46,371 INFO L93 Difference]: Finished difference Result 256 states and 284 transitions. [2021-08-27 07:49:46,371 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-08-27 07:49:46,372 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 5.933333333333334) internal successors, (89), 4 states have internal predecessors, (89), 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 117 [2021-08-27 07:49:46,372 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 07:49:46,372 INFO L225 Difference]: With dead ends: 256 [2021-08-27 07:49:46,372 INFO L226 Difference]: Without dead ends: 256 [2021-08-27 07:49:46,373 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 323.5ms TimeCoverageRelationStatistics Valid=114, Invalid=228, Unknown=0, NotChecked=0, Total=342 [2021-08-27 07:49:46,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 256 states. [2021-08-27 07:49:46,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 256 to 246. [2021-08-27 07:49:46,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 246 states, 192 states have (on average 1.140625) internal successors, (219), 194 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-08-27 07:49:46,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 246 states to 246 states and 272 transitions. [2021-08-27 07:49:46,376 INFO L78 Accepts]: Start accepts. Automaton has 246 states and 272 transitions. Word has length 117 [2021-08-27 07:49:46,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 07:49:46,376 INFO L470 AbstractCegarLoop]: Abstraction has 246 states and 272 transitions. [2021-08-27 07:49:46,376 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 5.933333333333334) internal successors, (89), 4 states have internal predecessors, (89), 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-08-27 07:49:46,377 INFO L276 IsEmpty]: Start isEmpty. Operand 246 states and 272 transitions. [2021-08-27 07:49:46,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2021-08-27 07:49:46,377 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 07:49:46,377 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] [2021-08-27 07:49:46,378 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2021-08-27 07:49:46,378 INFO L402 AbstractCegarLoop]: === Iteration 44 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2021-08-27 07:49:46,378 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 07:49:46,378 INFO L82 PathProgramCache]: Analyzing trace with hash -1044095359, now seen corresponding path program 1 times [2021-08-27 07:49:46,378 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 07:49:46,378 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1974383482] [2021-08-27 07:49:46,378 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 07:49:46,378 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 07:49:46,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:46,488 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 07:49:46,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:46,515 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-08-27 07:49:46,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:46,527 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-08-27 07:49:46,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:46,543 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-08-27 07:49:46,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:46,591 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2021-08-27 07:49:46,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:46,630 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-08-27 07:49:46,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:46,641 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-08-27 07:49:46,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:46,644 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-08-27 07:49:46,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:46,654 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-08-27 07:49:46,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:46,677 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2021-08-27 07:49:46,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:46,704 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-08-27 07:49:46,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:46,706 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2021-08-27 07:49:46,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:46,708 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2021-08-27 07:49:46,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:46,719 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 07:49:46,719 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 07:49:46,719 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1974383482] [2021-08-27 07:49:46,721 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1974383482] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 07:49:46,722 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 07:49:46,722 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2021-08-27 07:49:46,722 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [738124827] [2021-08-27 07:49:46,722 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2021-08-27 07:49:46,722 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 07:49:46,723 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-08-27 07:49:46,723 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=145, Unknown=0, NotChecked=0, Total=210 [2021-08-27 07:49:46,723 INFO L87 Difference]: Start difference. First operand 246 states and 272 transitions. Second operand has 15 states, 15 states have (on average 5.933333333333334) internal successors, (89), 4 states have internal predecessors, (89), 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-08-27 07:49:47,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 07:49:47,206 INFO L93 Difference]: Finished difference Result 256 states and 282 transitions. [2021-08-27 07:49:47,206 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-08-27 07:49:47,207 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 5.933333333333334) internal successors, (89), 4 states have internal predecessors, (89), 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 117 [2021-08-27 07:49:47,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 07:49:47,207 INFO L225 Difference]: With dead ends: 256 [2021-08-27 07:49:47,207 INFO L226 Difference]: Without dead ends: 252 [2021-08-27 07:49:47,208 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 255.5ms TimeCoverageRelationStatistics Valid=104, Invalid=238, Unknown=0, NotChecked=0, Total=342 [2021-08-27 07:49:47,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 252 states. [2021-08-27 07:49:47,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 252 to 246. [2021-08-27 07:49:47,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 246 states, 192 states have (on average 1.1354166666666667) internal successors, (218), 194 states have internal predecessors, (218), 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-08-27 07:49:47,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 246 states to 246 states and 271 transitions. [2021-08-27 07:49:47,211 INFO L78 Accepts]: Start accepts. Automaton has 246 states and 271 transitions. Word has length 117 [2021-08-27 07:49:47,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 07:49:47,211 INFO L470 AbstractCegarLoop]: Abstraction has 246 states and 271 transitions. [2021-08-27 07:49:47,211 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 5.933333333333334) internal successors, (89), 4 states have internal predecessors, (89), 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-08-27 07:49:47,211 INFO L276 IsEmpty]: Start isEmpty. Operand 246 states and 271 transitions. [2021-08-27 07:49:47,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2021-08-27 07:49:47,212 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 07:49:47,212 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] [2021-08-27 07:49:47,212 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2021-08-27 07:49:47,213 INFO L402 AbstractCegarLoop]: === Iteration 45 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2021-08-27 07:49:47,213 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 07:49:47,213 INFO L82 PathProgramCache]: Analyzing trace with hash 1109919017, now seen corresponding path program 1 times [2021-08-27 07:49:47,213 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 07:49:47,213 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1515430866] [2021-08-27 07:49:47,213 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 07:49:47,213 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 07:49:47,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:47,338 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 07:49:47,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:47,365 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-08-27 07:49:47,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:47,379 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-08-27 07:49:47,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:47,396 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-08-27 07:49:47,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:47,483 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2021-08-27 07:49:47,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:47,552 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-08-27 07:49:47,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:47,570 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-08-27 07:49:47,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:47,573 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-08-27 07:49:47,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:47,589 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-08-27 07:49:47,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:47,609 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2021-08-27 07:49:47,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:47,690 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-08-27 07:49:47,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:47,692 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2021-08-27 07:49:47,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:47,752 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-08-27 07:49:47,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:47,754 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-08-27 07:49:47,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:47,756 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-08-27 07:49:47,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:47,757 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2021-08-27 07:49:47,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:47,759 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2021-08-27 07:49:47,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:47,761 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2021-08-27 07:49:47,762 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 07:49:47,762 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1515430866] [2021-08-27 07:49:47,762 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1515430866] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 07:49:47,762 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 07:49:47,762 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [25] imperfect sequences [] total 25 [2021-08-27 07:49:47,762 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1218719400] [2021-08-27 07:49:47,763 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2021-08-27 07:49:47,763 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 07:49:47,763 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2021-08-27 07:49:47,764 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=515, Unknown=0, NotChecked=0, Total=600 [2021-08-27 07:49:47,764 INFO L87 Difference]: Start difference. First operand 246 states and 271 transitions. Second operand has 25 states, 25 states have (on average 3.92) internal successors, (98), 11 states have internal predecessors, (98), 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-08-27 07:49:48,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 07:49:48,730 INFO L93 Difference]: Finished difference Result 315 states and 356 transitions. [2021-08-27 07:49:48,731 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2021-08-27 07:49:48,731 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 3.92) internal successors, (98), 11 states have internal predecessors, (98), 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 147 [2021-08-27 07:49:48,731 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 07:49:48,732 INFO L225 Difference]: With dead ends: 315 [2021-08-27 07:49:48,732 INFO L226 Difference]: Without dead ends: 283 [2021-08-27 07:49:48,732 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 165 ImplicationChecksByTransitivity, 510.5ms TimeCoverageRelationStatistics Valid=148, Invalid=1042, Unknown=0, NotChecked=0, Total=1190 [2021-08-27 07:49:48,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 283 states. [2021-08-27 07:49:48,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 283 to 263. [2021-08-27 07:49:48,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 263 states, 207 states have (on average 1.144927536231884) internal successors, (237), 209 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-08-27 07:49:48,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 263 states to 263 states and 292 transitions. [2021-08-27 07:49:48,736 INFO L78 Accepts]: Start accepts. Automaton has 263 states and 292 transitions. Word has length 147 [2021-08-27 07:49:48,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 07:49:48,737 INFO L470 AbstractCegarLoop]: Abstraction has 263 states and 292 transitions. [2021-08-27 07:49:48,737 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 3.92) internal successors, (98), 11 states have internal predecessors, (98), 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-08-27 07:49:48,737 INFO L276 IsEmpty]: Start isEmpty. Operand 263 states and 292 transitions. [2021-08-27 07:49:48,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2021-08-27 07:49:48,738 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 07:49:48,738 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] [2021-08-27 07:49:48,739 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2021-08-27 07:49:48,739 INFO L402 AbstractCegarLoop]: === Iteration 46 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2021-08-27 07:49:48,739 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 07:49:48,739 INFO L82 PathProgramCache]: Analyzing trace with hash 2025391703, now seen corresponding path program 1 times [2021-08-27 07:49:48,739 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 07:49:48,739 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [262883817] [2021-08-27 07:49:48,740 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 07:49:48,740 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 07:49:48,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:48,874 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 07:49:48,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:48,905 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-08-27 07:49:48,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:48,921 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-08-27 07:49:48,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:48,941 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-08-27 07:49:48,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:49,013 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2021-08-27 07:49:49,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:49,073 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-08-27 07:49:49,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:49,090 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-08-27 07:49:49,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:49,093 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-08-27 07:49:49,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:49,108 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-08-27 07:49:49,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:49,127 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2021-08-27 07:49:49,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:49,217 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-08-27 07:49:49,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:49,221 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2021-08-27 07:49:49,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:49,259 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-08-27 07:49:49,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:49,262 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-08-27 07:49:49,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:49,265 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-08-27 07:49:49,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:49,267 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2021-08-27 07:49:49,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:49,269 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2021-08-27 07:49:49,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:49,271 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2021-08-27 07:49:49,272 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 07:49:49,272 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [262883817] [2021-08-27 07:49:49,272 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [262883817] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 07:49:49,272 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 07:49:49,272 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [24] imperfect sequences [] total 24 [2021-08-27 07:49:49,272 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1558091557] [2021-08-27 07:49:49,273 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2021-08-27 07:49:49,273 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 07:49:49,273 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2021-08-27 07:49:49,273 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=469, Unknown=0, NotChecked=0, Total=552 [2021-08-27 07:49:49,274 INFO L87 Difference]: Start difference. First operand 263 states and 292 transitions. Second operand has 24 states, 24 states have (on average 4.166666666666667) internal successors, (100), 10 states have internal predecessors, (100), 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-08-27 07:49:50,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 07:49:50,254 INFO L93 Difference]: Finished difference Result 282 states and 313 transitions. [2021-08-27 07:49:50,254 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2021-08-27 07:49:50,255 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 4.166666666666667) internal successors, (100), 10 states have internal predecessors, (100), 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 148 [2021-08-27 07:49:50,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 07:49:50,256 INFO L225 Difference]: With dead ends: 282 [2021-08-27 07:49:50,256 INFO L226 Difference]: Without dead ends: 277 [2021-08-27 07:49:50,256 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 122 ImplicationChecksByTransitivity, 463.0ms TimeCoverageRelationStatistics Valid=130, Invalid=740, Unknown=0, NotChecked=0, Total=870 [2021-08-27 07:49:50,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 277 states. [2021-08-27 07:49:50,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 277 to 263. [2021-08-27 07:49:50,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 263 states, 207 states have (on average 1.1400966183574879) internal successors, (236), 209 states have internal predecessors, (236), 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-08-27 07:49:50,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 263 states to 263 states and 291 transitions. [2021-08-27 07:49:50,267 INFO L78 Accepts]: Start accepts. Automaton has 263 states and 291 transitions. Word has length 148 [2021-08-27 07:49:50,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 07:49:50,268 INFO L470 AbstractCegarLoop]: Abstraction has 263 states and 291 transitions. [2021-08-27 07:49:50,268 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 4.166666666666667) internal successors, (100), 10 states have internal predecessors, (100), 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-08-27 07:49:50,268 INFO L276 IsEmpty]: Start isEmpty. Operand 263 states and 291 transitions. [2021-08-27 07:49:50,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2021-08-27 07:49:50,269 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 07:49:50,269 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-08-27 07:49:50,269 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45 [2021-08-27 07:49:50,270 INFO L402 AbstractCegarLoop]: === Iteration 47 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2021-08-27 07:49:50,270 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 07:49:50,270 INFO L82 PathProgramCache]: Analyzing trace with hash 1867828009, now seen corresponding path program 1 times [2021-08-27 07:49:50,270 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 07:49:50,270 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [120145732] [2021-08-27 07:49:50,270 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 07:49:50,271 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 07:49:50,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:50,410 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 07:49:50,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:50,442 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-08-27 07:49:50,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:50,460 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-08-27 07:49:50,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:50,481 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-08-27 07:49:50,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:50,553 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2021-08-27 07:49:50,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:50,623 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-08-27 07:49:50,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:50,641 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-08-27 07:49:50,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:50,645 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-08-27 07:49:50,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:50,661 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-08-27 07:49:50,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:50,683 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2021-08-27 07:49:50,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:50,704 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-08-27 07:49:50,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:50,707 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2021-08-27 07:49:50,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:50,711 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-08-27 07:49:50,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:50,715 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-08-27 07:49:50,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:50,717 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-08-27 07:49:50,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:50,720 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2021-08-27 07:49:50,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:50,743 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2021-08-27 07:49:50,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:50,746 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2021-08-27 07:49:50,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:50,749 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2021-08-27 07:49:50,749 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 07:49:50,749 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [120145732] [2021-08-27 07:49:50,749 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [120145732] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 07:49:50,749 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 07:49:50,749 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2021-08-27 07:49:50,750 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1132394869] [2021-08-27 07:49:50,750 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2021-08-27 07:49:50,750 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 07:49:50,750 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2021-08-27 07:49:50,751 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=343, Unknown=0, NotChecked=0, Total=420 [2021-08-27 07:49:50,751 INFO L87 Difference]: Start difference. First operand 263 states and 291 transitions. Second operand has 21 states, 21 states have (on average 4.428571428571429) internal successors, (93), 8 states have internal predecessors, (93), 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-08-27 07:49:51,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 07:49:51,579 INFO L93 Difference]: Finished difference Result 301 states and 336 transitions. [2021-08-27 07:49:51,579 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2021-08-27 07:49:51,580 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 4.428571428571429) internal successors, (93), 8 states have internal predecessors, (93), 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 150 [2021-08-27 07:49:51,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 07:49:51,580 INFO L225 Difference]: With dead ends: 301 [2021-08-27 07:49:51,580 INFO L226 Difference]: Without dead ends: 263 [2021-08-27 07:49:51,581 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 100 ImplicationChecksByTransitivity, 505.4ms TimeCoverageRelationStatistics Valid=141, Invalid=671, Unknown=0, NotChecked=0, Total=812 [2021-08-27 07:49:51,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 263 states. [2021-08-27 07:49:51,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 263 to 257. [2021-08-27 07:49:51,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 257 states, 203 states have (on average 1.1280788177339902) internal successors, (229), 205 states have internal predecessors, (229), 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-08-27 07:49:51,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 257 states to 257 states and 282 transitions. [2021-08-27 07:49:51,585 INFO L78 Accepts]: Start accepts. Automaton has 257 states and 282 transitions. Word has length 150 [2021-08-27 07:49:51,585 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 07:49:51,585 INFO L470 AbstractCegarLoop]: Abstraction has 257 states and 282 transitions. [2021-08-27 07:49:51,585 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 4.428571428571429) internal successors, (93), 8 states have internal predecessors, (93), 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-08-27 07:49:51,585 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 282 transitions. [2021-08-27 07:49:51,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2021-08-27 07:49:51,586 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 07:49:51,586 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] [2021-08-27 07:49:51,586 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46 [2021-08-27 07:49:51,586 INFO L402 AbstractCegarLoop]: === Iteration 48 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2021-08-27 07:49:51,586 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 07:49:51,586 INFO L82 PathProgramCache]: Analyzing trace with hash -495529015, now seen corresponding path program 1 times [2021-08-27 07:49:51,586 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 07:49:51,586 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1530029923] [2021-08-27 07:49:51,586 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 07:49:51,586 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 07:49:51,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:51,714 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 07:49:51,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:51,741 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-08-27 07:49:51,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:51,755 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-08-27 07:49:51,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:51,771 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-08-27 07:49:51,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:51,828 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2021-08-27 07:49:51,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:51,876 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-08-27 07:49:51,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:51,889 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-08-27 07:49:51,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:51,892 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-08-27 07:49:51,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:51,904 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-08-27 07:49:51,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:51,922 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2021-08-27 07:49:51,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:51,945 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-08-27 07:49:51,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:51,948 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2021-08-27 07:49:51,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:51,951 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-08-27 07:49:51,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:51,954 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-08-27 07:49:51,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:51,956 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-08-27 07:49:51,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:51,958 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2021-08-27 07:49:51,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:51,960 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2021-08-27 07:49:51,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:51,963 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2021-08-27 07:49:51,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:51,965 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2021-08-27 07:49:51,965 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 07:49:51,966 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1530029923] [2021-08-27 07:49:51,966 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1530029923] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 07:49:51,966 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 07:49:51,966 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2021-08-27 07:49:51,966 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [942048530] [2021-08-27 07:49:51,967 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2021-08-27 07:49:51,967 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 07:49:51,967 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-08-27 07:49:51,967 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=145, Unknown=0, NotChecked=0, Total=210 [2021-08-27 07:49:51,967 INFO L87 Difference]: Start difference. First operand 257 states and 282 transitions. Second operand has 15 states, 15 states have (on average 6.533333333333333) internal successors, (98), 5 states have internal predecessors, (98), 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-08-27 07:49:52,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 07:49:52,573 INFO L93 Difference]: Finished difference Result 254 states and 276 transitions. [2021-08-27 07:49:52,574 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-08-27 07:49:52,574 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 6.533333333333333) internal successors, (98), 5 states have internal predecessors, (98), 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 155 [2021-08-27 07:49:52,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 07:49:52,575 INFO L225 Difference]: With dead ends: 254 [2021-08-27 07:49:52,575 INFO L226 Difference]: Without dead ends: 243 [2021-08-27 07:49:52,575 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 77 ImplicationChecksByTransitivity, 397.8ms TimeCoverageRelationStatistics Valid=147, Invalid=405, Unknown=0, NotChecked=0, Total=552 [2021-08-27 07:49:52,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 243 states. [2021-08-27 07:49:52,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 243 to 229. [2021-08-27 07:49:52,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 229 states, 179 states have (on average 1.111731843575419) internal successors, (199), 181 states have internal predecessors, (199), 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-08-27 07:49:52,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 229 states to 229 states and 248 transitions. [2021-08-27 07:49:52,584 INFO L78 Accepts]: Start accepts. Automaton has 229 states and 248 transitions. Word has length 155 [2021-08-27 07:49:52,584 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 07:49:52,584 INFO L470 AbstractCegarLoop]: Abstraction has 229 states and 248 transitions. [2021-08-27 07:49:52,584 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 6.533333333333333) internal successors, (98), 5 states have internal predecessors, (98), 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-08-27 07:49:52,584 INFO L276 IsEmpty]: Start isEmpty. Operand 229 states and 248 transitions. [2021-08-27 07:49:52,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2021-08-27 07:49:52,585 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 07:49:52,585 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] [2021-08-27 07:49:52,585 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47 [2021-08-27 07:49:52,587 INFO L402 AbstractCegarLoop]: === Iteration 49 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2021-08-27 07:49:52,588 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 07:49:52,588 INFO L82 PathProgramCache]: Analyzing trace with hash -1029557280, now seen corresponding path program 1 times [2021-08-27 07:49:52,588 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 07:49:52,588 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [426610835] [2021-08-27 07:49:52,588 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 07:49:52,588 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 07:49:52,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:52,711 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 07:49:52,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:52,738 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-08-27 07:49:52,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:52,763 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-08-27 07:49:52,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:52,779 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-08-27 07:49:52,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:52,821 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2021-08-27 07:49:52,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:52,851 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-08-27 07:49:52,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:52,862 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-08-27 07:49:52,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:52,865 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-08-27 07:49:52,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:52,875 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-08-27 07:49:52,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:52,888 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2021-08-27 07:49:52,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:52,925 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-08-27 07:49:52,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:52,928 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2021-08-27 07:49:52,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:52,954 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-08-27 07:49:52,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:52,957 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-08-27 07:49:52,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:52,959 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-08-27 07:49:52,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:52,976 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2021-08-27 07:49:52,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:52,979 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2021-08-27 07:49:52,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:52,982 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2021-08-27 07:49:52,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:52,984 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2021-08-27 07:49:52,984 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 07:49:52,984 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [426610835] [2021-08-27 07:49:52,984 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [426610835] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 07:49:52,985 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 07:49:52,985 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2021-08-27 07:49:52,985 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [946119390] [2021-08-27 07:49:52,985 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2021-08-27 07:49:52,985 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 07:49:52,986 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2021-08-27 07:49:52,986 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=194, Unknown=0, NotChecked=0, Total=272 [2021-08-27 07:49:52,986 INFO L87 Difference]: Start difference. First operand 229 states and 248 transitions. Second operand has 17 states, 17 states have (on average 6.235294117647059) internal successors, (106), 5 states have internal predecessors, (106), 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-08-27 07:49:53,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 07:49:53,521 INFO L93 Difference]: Finished difference Result 218 states and 234 transitions. [2021-08-27 07:49:53,522 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-08-27 07:49:53,522 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 6.235294117647059) internal successors, (106), 5 states have internal predecessors, (106), 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 157 [2021-08-27 07:49:53,522 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 07:49:53,522 INFO L225 Difference]: With dead ends: 218 [2021-08-27 07:49:53,522 INFO L226 Difference]: Without dead ends: 208 [2021-08-27 07:49:53,523 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 92 ImplicationChecksByTransitivity, 296.5ms TimeCoverageRelationStatistics Valid=124, Invalid=338, Unknown=0, NotChecked=0, Total=462 [2021-08-27 07:49:53,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 208 states. [2021-08-27 07:49:53,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 208 to 208. [2021-08-27 07:49:53,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 208 states, 161 states have (on average 1.0993788819875776) internal successors, (177), 162 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-08-27 07:49:53,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 223 transitions. [2021-08-27 07:49:53,525 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 223 transitions. Word has length 157 [2021-08-27 07:49:53,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 07:49:53,525 INFO L470 AbstractCegarLoop]: Abstraction has 208 states and 223 transitions. [2021-08-27 07:49:53,525 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 6.235294117647059) internal successors, (106), 5 states have internal predecessors, (106), 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-08-27 07:49:53,526 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 223 transitions. [2021-08-27 07:49:53,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2021-08-27 07:49:53,526 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 07:49:53,526 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] [2021-08-27 07:49:53,527 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable48 [2021-08-27 07:49:53,527 INFO L402 AbstractCegarLoop]: === Iteration 50 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2021-08-27 07:49:53,527 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 07:49:53,527 INFO L82 PathProgramCache]: Analyzing trace with hash -1506473619, now seen corresponding path program 1 times [2021-08-27 07:49:53,527 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 07:49:53,527 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2042021307] [2021-08-27 07:49:53,527 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 07:49:53,527 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 07:49:53,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:53,651 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 07:49:53,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:53,676 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-08-27 07:49:53,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:53,692 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-08-27 07:49:53,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:53,728 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-08-27 07:49:53,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:53,807 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2021-08-27 07:49:53,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:53,865 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-08-27 07:49:53,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:53,881 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-08-27 07:49:53,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:53,884 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-08-27 07:49:53,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:53,898 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-08-27 07:49:53,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:53,916 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2021-08-27 07:49:53,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:53,961 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-08-27 07:49:53,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:53,964 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2021-08-27 07:49:53,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:53,968 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-08-27 07:49:53,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:53,970 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-08-27 07:49:53,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:53,972 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-08-27 07:49:53,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:53,991 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2021-08-27 07:49:53,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:53,994 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2021-08-27 07:49:53,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:53,996 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2021-08-27 07:49:53,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:54,001 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2021-08-27 07:49:54,002 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 07:49:54,002 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2042021307] [2021-08-27 07:49:54,002 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2042021307] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 07:49:54,002 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 07:49:54,002 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2021-08-27 07:49:54,002 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2028904583] [2021-08-27 07:49:54,002 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2021-08-27 07:49:54,002 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 07:49:54,003 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2021-08-27 07:49:54,003 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=293, Unknown=0, NotChecked=0, Total=380 [2021-08-27 07:49:54,003 INFO L87 Difference]: Start difference. First operand 208 states and 223 transitions. Second operand has 20 states, 20 states have (on average 5.2) internal successors, (104), 8 states have internal predecessors, (104), 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-08-27 07:49:55,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 07:49:55,309 INFO L93 Difference]: Finished difference Result 351 states and 375 transitions. [2021-08-27 07:49:55,309 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2021-08-27 07:49:55,309 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 5.2) internal successors, (104), 8 states have internal predecessors, (104), 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 158 [2021-08-27 07:49:55,309 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 07:49:55,310 INFO L225 Difference]: With dead ends: 351 [2021-08-27 07:49:55,310 INFO L226 Difference]: Without dead ends: 211 [2021-08-27 07:49:55,311 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 541 ImplicationChecksByTransitivity, 808.5ms TimeCoverageRelationStatistics Valid=387, Invalid=1965, Unknown=0, NotChecked=0, Total=2352 [2021-08-27 07:49:55,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2021-08-27 07:49:55,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 208. [2021-08-27 07:49:55,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 208 states, 161 states have (on average 1.093167701863354) internal successors, (176), 162 states have internal predecessors, (176), 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-08-27 07:49:55,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 222 transitions. [2021-08-27 07:49:55,316 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 222 transitions. Word has length 158 [2021-08-27 07:49:55,316 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 07:49:55,316 INFO L470 AbstractCegarLoop]: Abstraction has 208 states and 222 transitions. [2021-08-27 07:49:55,316 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 5.2) internal successors, (104), 8 states have internal predecessors, (104), 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-08-27 07:49:55,316 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 222 transitions. [2021-08-27 07:49:55,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2021-08-27 07:49:55,317 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 07:49:55,317 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] [2021-08-27 07:49:55,317 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable49 [2021-08-27 07:49:55,317 INFO L402 AbstractCegarLoop]: === Iteration 51 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2021-08-27 07:49:55,318 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 07:49:55,318 INFO L82 PathProgramCache]: Analyzing trace with hash 424652015, now seen corresponding path program 1 times [2021-08-27 07:49:55,318 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 07:49:55,318 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1865137860] [2021-08-27 07:49:55,318 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 07:49:55,318 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 07:49:55,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:55,461 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 07:49:55,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:55,490 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-08-27 07:49:55,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:55,505 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-08-27 07:49:55,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:55,524 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-08-27 07:49:55,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:55,638 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2021-08-27 07:49:55,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:55,717 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-08-27 07:49:55,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:55,737 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-08-27 07:49:55,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:55,742 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-08-27 07:49:55,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:55,759 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-08-27 07:49:55,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:55,782 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2021-08-27 07:49:55,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:55,839 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-08-27 07:49:55,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:55,851 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2021-08-27 07:49:55,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:55,856 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-08-27 07:49:55,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:55,858 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-08-27 07:49:55,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:55,861 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-08-27 07:49:55,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:55,885 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2021-08-27 07:49:55,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:55,888 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2021-08-27 07:49:55,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:55,891 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2021-08-27 07:49:55,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:55,894 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2021-08-27 07:49:55,894 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 07:49:55,894 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1865137860] [2021-08-27 07:49:55,894 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1865137860] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 07:49:55,894 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 07:49:55,895 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [26] imperfect sequences [] total 26 [2021-08-27 07:49:55,895 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [673667935] [2021-08-27 07:49:55,895 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2021-08-27 07:49:55,895 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 07:49:55,896 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2021-08-27 07:49:55,896 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=103, Invalid=547, Unknown=0, NotChecked=0, Total=650 [2021-08-27 07:49:55,896 INFO L87 Difference]: Start difference. First operand 208 states and 222 transitions. Second operand has 26 states, 26 states have (on average 4.0) internal successors, (104), 12 states have internal predecessors, (104), 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-08-27 07:49:57,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 07:49:57,129 INFO L93 Difference]: Finished difference Result 208 states and 223 transitions. [2021-08-27 07:49:57,130 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2021-08-27 07:49:57,130 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 4.0) internal successors, (104), 12 states have internal predecessors, (104), 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 158 [2021-08-27 07:49:57,130 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 07:49:57,130 INFO L225 Difference]: With dead ends: 208 [2021-08-27 07:49:57,130 INFO L226 Difference]: Without dead ends: 0 [2021-08-27 07:49:57,131 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 352 ImplicationChecksByTransitivity, 783.7ms TimeCoverageRelationStatistics Valid=287, Invalid=1783, Unknown=0, NotChecked=0, Total=2070 [2021-08-27 07:49:57,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2021-08-27 07:49:57,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2021-08-27 07:49:57,131 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-08-27 07:49:57,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2021-08-27 07:49:57,131 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 158 [2021-08-27 07:49:57,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 07:49:57,131 INFO L470 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-08-27 07:49:57,132 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 4.0) internal successors, (104), 12 states have internal predecessors, (104), 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-08-27 07:49:57,132 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2021-08-27 07:49:57,132 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-08-27 07:49:57,133 INFO L764 garLoopResultBuilder]: Registering result SAFE for location mainErr0ENSURES_VIOLATIONMEMORY_LEAK [2021-08-27 07:49:57,134 INFO L764 garLoopResultBuilder]: Registering result SAFE for location errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK [2021-08-27 07:49:57,135 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50 [2021-08-27 07:49:57,138 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-08-27 07:49:57,140 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.08 07:49:57 BoogieIcfgContainer [2021-08-27 07:49:57,140 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-08-27 07:49:57,141 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-08-27 07:49:57,141 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-08-27 07:49:57,141 INFO L275 PluginConnector]: Witness Printer initialized [2021-08-27 07:49:57,142 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.08 07:48:44" (3/4) ... [2021-08-27 07:49:57,144 INFO L137 WitnessPrinter]: Generating witness for correct program [2021-08-27 07:49:57,151 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure reach_error [2021-08-27 07:49:57,151 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure IoRegisterDeviceInterface [2021-08-27 07:49:57,151 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure _BLAST_init [2021-08-27 07:49:57,151 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure FloppyProcessQueuedRequests [2021-08-27 07:49:57,152 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure IoSetDeviceInterfaceState [2021-08-27 07:49:57,152 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure FloppyPnp [2021-08-27 07:49:57,152 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2021-08-27 07:49:57,152 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure FloppyCreateClose [2021-08-27 07:49:57,152 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure stubMoreProcessingRequired [2021-08-27 07:49:57,152 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure FloppyPnpComplete [2021-08-27 07:49:57,152 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure KeWaitForSingleObject [2021-08-27 07:49:57,152 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure IofCompleteRequest [2021-08-27 07:49:57,153 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure FloppyStartDevice [2021-08-27 07:49:57,153 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure PsCreateSystemThread [2021-08-27 07:49:57,153 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ObReferenceObjectByHandle [2021-08-27 07:49:57,153 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure IoBuildDeviceIoControlRequest [2021-08-27 07:49:57,153 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure KeSetEvent [2021-08-27 07:49:57,153 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure stub_driver_init [2021-08-27 07:49:57,153 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure errorFn [2021-08-27 07:49:57,153 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure FlQueueIrpToThread [2021-08-27 07:49:57,153 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure IofCallDriver [2021-08-27 07:49:57,154 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2021-08-27 07:49:57,154 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure FlFdcDeviceIo [2021-08-27 07:49:57,154 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure FlAcpiConfigureFloppy [2021-08-27 07:49:57,154 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure IoDeleteSymbolicLink [2021-08-27 07:49:57,154 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure IoQueryDeviceDescription [2021-08-27 07:49:57,155 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ZwClose [2021-08-27 07:49:57,168 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 78 nodes and edges [2021-08-27 07:49:57,169 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 45 nodes and edges [2021-08-27 07:49:57,170 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2021-08-27 07:49:57,171 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2021-08-27 07:49:57,255 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2021-08-27 07:49:57,255 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-08-27 07:49:57,256 INFO L168 Benchmark]: Toolchain (without parser) took 74485.78 ms. Allocated memory was 50.3 MB in the beginning and 362.8 MB in the end (delta: 312.5 MB). Free memory was 26.1 MB in the beginning and 223.9 MB in the end (delta: -197.8 MB). Peak memory consumption was 114.3 MB. Max. memory is 16.1 GB. [2021-08-27 07:49:57,257 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 50.3 MB. Free memory was 32.4 MB in the beginning and 32.3 MB in the end (delta: 71.1 kB). There was no memory consumed. Max. memory is 16.1 GB. [2021-08-27 07:49:57,257 INFO L168 Benchmark]: CACSL2BoogieTranslator took 411.58 ms. Allocated memory was 50.3 MB in the beginning and 67.1 MB in the end (delta: 16.8 MB). Free memory was 25.9 MB in the beginning and 44.1 MB in the end (delta: -18.3 MB). Peak memory consumption was 6.9 MB. Max. memory is 16.1 GB. [2021-08-27 07:49:57,257 INFO L168 Benchmark]: Boogie Preprocessor took 109.15 ms. Allocated memory is still 67.1 MB. Free memory was 44.1 MB in the beginning and 40.6 MB in the end (delta: 3.6 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. [2021-08-27 07:49:57,258 INFO L168 Benchmark]: RCFGBuilder took 1278.70 ms. Allocated memory is still 67.1 MB. Free memory was 40.6 MB in the beginning and 30.6 MB in the end (delta: 9.9 MB). Peak memory consumption was 18.1 MB. Max. memory is 16.1 GB. [2021-08-27 07:49:57,258 INFO L168 Benchmark]: TraceAbstraction took 72564.95 ms. Allocated memory was 67.1 MB in the beginning and 362.8 MB in the end (delta: 295.7 MB). Free memory was 30.3 MB in the beginning and 242.7 MB in the end (delta: -212.5 MB). Peak memory consumption was 83.1 MB. Max. memory is 16.1 GB. [2021-08-27 07:49:57,258 INFO L168 Benchmark]: Witness Printer took 114.24 ms. Allocated memory is still 362.8 MB. Free memory was 242.7 MB in the beginning and 223.9 MB in the end (delta: 18.9 MB). Peak memory consumption was 18.9 MB. Max. memory is 16.1 GB. [2021-08-27 07:49:57,260 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.17 ms. Allocated memory is still 50.3 MB. Free memory was 32.4 MB in the beginning and 32.3 MB in the end (delta: 71.1 kB). There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 411.58 ms. Allocated memory was 50.3 MB in the beginning and 67.1 MB in the end (delta: 16.8 MB). Free memory was 25.9 MB in the beginning and 44.1 MB in the end (delta: -18.3 MB). Peak memory consumption was 6.9 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 109.15 ms. Allocated memory is still 67.1 MB. Free memory was 44.1 MB in the beginning and 40.6 MB in the end (delta: 3.6 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. * RCFGBuilder took 1278.70 ms. Allocated memory is still 67.1 MB. Free memory was 40.6 MB in the beginning and 30.6 MB in the end (delta: 9.9 MB). Peak memory consumption was 18.1 MB. Max. memory is 16.1 GB. * TraceAbstraction took 72564.95 ms. Allocated memory was 67.1 MB in the beginning and 362.8 MB in the end (delta: 295.7 MB). Free memory was 30.3 MB in the beginning and 242.7 MB in the end (delta: -212.5 MB). Peak memory consumption was 83.1 MB. Max. memory is 16.1 GB. * Witness Printer took 114.24 ms. Allocated memory is still 362.8 MB. Free memory was 242.7 MB in the beginning and 223.9 MB in the end (delta: 18.9 MB). Peak memory consumption was 18.9 MB. Max. memory is 16.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.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: 670]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - PositiveResult [Line: 65]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 28 procedures, 313 locations, 2 error locations. Started 1 CEGAR loops. OverallTime: 72524.7ms, OverallIterations: 51, TraceHistogramMax: 2, EmptinessCheckTime: 69.6ms, AutomataDifference: 55798.6ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 19.0ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 15311 SDtfs, 21994 SDslu, 35616 SDs, 0 SdLazy, 57322 SolverSat, 7549 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 37232.4ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1520 GetRequests, 695 SyntacticMatches, 0 SemanticMatches, 825 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2856 ImplicationChecksByTransitivity, 18669.4ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=831occurred in iteration=11, InterpolantAutomatonStates: 665, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: 607.6ms AutomataMinimizationTime, 51 MinimizatonAttempts, 2436 StatesRemovedByMinimization, 49 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 196.0ms SsaConstructionTime, 630.5ms SatisfiabilityAnalysisTime, 14736.0ms InterpolantComputationTime, 3807 NumberOfCodeBlocks, 3807 NumberOfCodeBlocksAsserted, 51 NumberOfCheckSat, 3756 ConstructedInterpolants, 0 QuantifiedInterpolants, 17225 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 51 InterpolantComputations, 51 PerfectInterpolantSequences, 204/204 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-08-27 07:49:57,294 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...