./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 e943c265 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8416fbd5-b9f1-43e7-8f6b-358922e2d2bf/bin/uautomizer-j4sWxH34Be/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8416fbd5-b9f1-43e7-8f6b-358922e2d2bf/bin/uautomizer-j4sWxH34Be/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8416fbd5-b9f1-43e7-8f6b-358922e2d2bf/bin/uautomizer-j4sWxH34Be/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8416fbd5-b9f1-43e7-8f6b-358922e2d2bf/bin/uautomizer-j4sWxH34Be/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/ntdrivers-simplified/floppy_simpl3.cil-2.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8416fbd5-b9f1-43e7-8f6b-358922e2d2bf/bin/uautomizer-j4sWxH34Be/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8416fbd5-b9f1-43e7-8f6b-358922e2d2bf/bin/uautomizer-j4sWxH34Be --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 1fa38cbba4031a56736a5ec3c724b1da0a42c893b0e9010b5807defb3e1b19fa ...................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.2.1-dev-e943c26 [2021-10-21 19:38:52,188 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-10-21 19:38:52,191 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-10-21 19:38:52,246 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-10-21 19:38:52,247 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-10-21 19:38:52,252 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-10-21 19:38:52,254 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-10-21 19:38:52,258 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-10-21 19:38:52,261 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-10-21 19:38:52,268 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-10-21 19:38:52,269 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-10-21 19:38:52,271 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-10-21 19:38:52,271 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-10-21 19:38:52,274 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-10-21 19:38:52,276 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-10-21 19:38:52,284 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-10-21 19:38:52,285 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-10-21 19:38:52,286 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-10-21 19:38:52,288 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-10-21 19:38:52,290 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-10-21 19:38:52,292 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-10-21 19:38:52,294 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-10-21 19:38:52,297 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-10-21 19:38:52,298 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-10-21 19:38:52,307 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-10-21 19:38:52,308 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-10-21 19:38:52,308 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-10-21 19:38:52,310 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-10-21 19:38:52,311 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-10-21 19:38:52,312 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-10-21 19:38:52,312 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-10-21 19:38:52,313 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-10-21 19:38:52,315 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-10-21 19:38:52,316 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-10-21 19:38:52,318 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-10-21 19:38:52,318 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-10-21 19:38:52,318 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-10-21 19:38:52,319 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-10-21 19:38:52,319 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-10-21 19:38:52,320 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-10-21 19:38:52,320 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-10-21 19:38:52,321 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8416fbd5-b9f1-43e7-8f6b-358922e2d2bf/bin/uautomizer-j4sWxH34Be/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2021-10-21 19:38:52,365 INFO L113 SettingsManager]: Loading preferences was successful [2021-10-21 19:38:52,365 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-10-21 19:38:52,366 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-10-21 19:38:52,366 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-10-21 19:38:52,373 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-10-21 19:38:52,373 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-10-21 19:38:52,373 INFO L138 SettingsManager]: * Use SBE=true [2021-10-21 19:38:52,374 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-10-21 19:38:52,374 INFO L138 SettingsManager]: * sizeof long=4 [2021-10-21 19:38:52,374 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2021-10-21 19:38:52,375 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-10-21 19:38:52,375 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-10-21 19:38:52,375 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-10-21 19:38:52,376 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2021-10-21 19:38:52,376 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2021-10-21 19:38:52,376 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2021-10-21 19:38:52,376 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-10-21 19:38:52,376 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2021-10-21 19:38:52,377 INFO L138 SettingsManager]: * sizeof long double=12 [2021-10-21 19:38:52,377 INFO L138 SettingsManager]: * Use constant arrays=true [2021-10-21 19:38:52,377 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-10-21 19:38:52,377 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-10-21 19:38:52,377 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-10-21 19:38:52,378 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-10-21 19:38:52,378 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-10-21 19:38:52,378 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-10-21 19:38:52,378 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-10-21 19:38:52,378 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-10-21 19:38:52,379 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-10-21 19:38:52,379 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8416fbd5-b9f1-43e7-8f6b-358922e2d2bf/bin/uautomizer-j4sWxH34Be/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8416fbd5-b9f1-43e7-8f6b-358922e2d2bf/bin/uautomizer-j4sWxH34Be 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 -> 1fa38cbba4031a56736a5ec3c724b1da0a42c893b0e9010b5807defb3e1b19fa [2021-10-21 19:38:52,622 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-10-21 19:38:52,641 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-10-21 19:38:52,644 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-10-21 19:38:52,645 INFO L271 PluginConnector]: Initializing CDTParser... [2021-10-21 19:38:52,646 INFO L275 PluginConnector]: CDTParser initialized [2021-10-21 19:38:52,647 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8416fbd5-b9f1-43e7-8f6b-358922e2d2bf/bin/uautomizer-j4sWxH34Be/../../sv-benchmarks/c/ntdrivers-simplified/floppy_simpl3.cil-2.c [2021-10-21 19:38:52,718 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8416fbd5-b9f1-43e7-8f6b-358922e2d2bf/bin/uautomizer-j4sWxH34Be/data/b6fc6eecc/877330b4db144084b6dd33dfa181a611/FLAGeecca7519 [2021-10-21 19:38:53,280 INFO L306 CDTParser]: Found 1 translation units. [2021-10-21 19:38:53,280 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8416fbd5-b9f1-43e7-8f6b-358922e2d2bf/sv-benchmarks/c/ntdrivers-simplified/floppy_simpl3.cil-2.c [2021-10-21 19:38:53,294 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8416fbd5-b9f1-43e7-8f6b-358922e2d2bf/bin/uautomizer-j4sWxH34Be/data/b6fc6eecc/877330b4db144084b6dd33dfa181a611/FLAGeecca7519 [2021-10-21 19:38:53,581 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8416fbd5-b9f1-43e7-8f6b-358922e2d2bf/bin/uautomizer-j4sWxH34Be/data/b6fc6eecc/877330b4db144084b6dd33dfa181a611 [2021-10-21 19:38:53,584 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-10-21 19:38:53,586 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2021-10-21 19:38:53,592 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-10-21 19:38:53,592 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-10-21 19:38:53,595 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-10-21 19:38:53,596 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.10 07:38:53" (1/1) ... [2021-10-21 19:38:53,598 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5ddad16f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 07:38:53, skipping insertion in model container [2021-10-21 19:38:53,599 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.10 07:38:53" (1/1) ... [2021-10-21 19:38:53,607 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-10-21 19:38:53,663 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-10-21 19:38:53,882 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8416fbd5-b9f1-43e7-8f6b-358922e2d2bf/sv-benchmarks/c/ntdrivers-simplified/floppy_simpl3.cil-2.c[2713,2726] [2021-10-21 19:38:54,038 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-10-21 19:38:54,050 INFO L203 MainTranslator]: Completed pre-run [2021-10-21 19:38:54,084 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8416fbd5-b9f1-43e7-8f6b-358922e2d2bf/sv-benchmarks/c/ntdrivers-simplified/floppy_simpl3.cil-2.c[2713,2726] [2021-10-21 19:38:54,181 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-10-21 19:38:54,203 INFO L208 MainTranslator]: Completed translation [2021-10-21 19:38:54,203 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 07:38:54 WrapperNode [2021-10-21 19:38:54,203 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-10-21 19:38:54,204 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-10-21 19:38:54,205 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-10-21 19:38:54,205 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-10-21 19:38:54,215 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 07:38:54" (1/1) ... [2021-10-21 19:38:54,216 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 07:38:54" (1/1) ... [2021-10-21 19:38:54,233 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 07:38:54" (1/1) ... [2021-10-21 19:38:54,234 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 07:38:54" (1/1) ... [2021-10-21 19:38:54,300 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 07:38:54" (1/1) ... [2021-10-21 19:38:54,320 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 07:38:54" (1/1) ... [2021-10-21 19:38:54,324 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 07:38:54" (1/1) ... [2021-10-21 19:38:54,344 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-10-21 19:38:54,345 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-10-21 19:38:54,345 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-10-21 19:38:54,346 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-10-21 19:38:54,347 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 07:38:54" (1/1) ... [2021-10-21 19:38:54,354 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-10-21 19:38:54,364 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8416fbd5-b9f1-43e7-8f6b-358922e2d2bf/bin/uautomizer-j4sWxH34Be/z3 [2021-10-21 19:38:54,375 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8416fbd5-b9f1-43e7-8f6b-358922e2d2bf/bin/uautomizer-j4sWxH34Be/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-10-21 19:38:54,402 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8416fbd5-b9f1-43e7-8f6b-358922e2d2bf/bin/uautomizer-j4sWxH34Be/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-10-21 19:38:54,427 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2021-10-21 19:38:54,428 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-10-21 19:38:54,428 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2021-10-21 19:38:54,429 INFO L138 BoogieDeclarations]: Found implementation of procedure errorFn [2021-10-21 19:38:54,429 INFO L138 BoogieDeclarations]: Found implementation of procedure _BLAST_init [2021-10-21 19:38:54,430 INFO L138 BoogieDeclarations]: Found implementation of procedure FlAcpiConfigureFloppy [2021-10-21 19:38:54,430 INFO L138 BoogieDeclarations]: Found implementation of procedure FlQueueIrpToThread [2021-10-21 19:38:54,430 INFO L138 BoogieDeclarations]: Found implementation of procedure FloppyPnp [2021-10-21 19:38:54,430 INFO L138 BoogieDeclarations]: Found implementation of procedure FloppyStartDevice [2021-10-21 19:38:54,431 INFO L138 BoogieDeclarations]: Found implementation of procedure FloppyPnpComplete [2021-10-21 19:38:54,431 INFO L138 BoogieDeclarations]: Found implementation of procedure FlFdcDeviceIo [2021-10-21 19:38:54,432 INFO L138 BoogieDeclarations]: Found implementation of procedure FloppyProcessQueuedRequests [2021-10-21 19:38:54,432 INFO L138 BoogieDeclarations]: Found implementation of procedure stub_driver_init [2021-10-21 19:38:54,432 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2021-10-21 19:38:54,432 INFO L138 BoogieDeclarations]: Found implementation of procedure IoBuildDeviceIoControlRequest [2021-10-21 19:38:54,432 INFO L138 BoogieDeclarations]: Found implementation of procedure IoDeleteSymbolicLink [2021-10-21 19:38:54,432 INFO L138 BoogieDeclarations]: Found implementation of procedure IoQueryDeviceDescription [2021-10-21 19:38:54,432 INFO L138 BoogieDeclarations]: Found implementation of procedure IoRegisterDeviceInterface [2021-10-21 19:38:54,433 INFO L138 BoogieDeclarations]: Found implementation of procedure IoSetDeviceInterfaceState [2021-10-21 19:38:54,433 INFO L138 BoogieDeclarations]: Found implementation of procedure stubMoreProcessingRequired [2021-10-21 19:38:54,433 INFO L138 BoogieDeclarations]: Found implementation of procedure IofCallDriver [2021-10-21 19:38:54,433 INFO L138 BoogieDeclarations]: Found implementation of procedure IofCompleteRequest [2021-10-21 19:38:54,433 INFO L138 BoogieDeclarations]: Found implementation of procedure KeSetEvent [2021-10-21 19:38:54,433 INFO L138 BoogieDeclarations]: Found implementation of procedure KeWaitForSingleObject [2021-10-21 19:38:54,434 INFO L138 BoogieDeclarations]: Found implementation of procedure ObReferenceObjectByHandle [2021-10-21 19:38:54,434 INFO L138 BoogieDeclarations]: Found implementation of procedure PsCreateSystemThread [2021-10-21 19:38:54,434 INFO L138 BoogieDeclarations]: Found implementation of procedure ZwClose [2021-10-21 19:38:54,434 INFO L138 BoogieDeclarations]: Found implementation of procedure FloppyCreateClose [2021-10-21 19:38:54,434 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2021-10-21 19:38:54,434 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2021-10-21 19:38:54,435 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2021-10-21 19:38:54,435 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-10-21 19:38:54,435 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2021-10-21 19:38:54,435 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2021-10-21 19:38:54,435 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_long [2021-10-21 19:38:54,435 INFO L130 BoogieDeclarations]: Found specification of procedure FlAcpiConfigureFloppy [2021-10-21 19:38:54,436 INFO L130 BoogieDeclarations]: Found specification of procedure FlQueueIrpToThread [2021-10-21 19:38:54,436 INFO L130 BoogieDeclarations]: Found specification of procedure FloppyPnp [2021-10-21 19:38:54,436 INFO L130 BoogieDeclarations]: Found specification of procedure FloppyStartDevice [2021-10-21 19:38:54,436 INFO L130 BoogieDeclarations]: Found specification of procedure FloppyPnpComplete [2021-10-21 19:38:54,436 INFO L130 BoogieDeclarations]: Found specification of procedure FlFdcDeviceIo [2021-10-21 19:38:54,436 INFO L130 BoogieDeclarations]: Found specification of procedure IoBuildDeviceIoControlRequest [2021-10-21 19:38:54,437 INFO L130 BoogieDeclarations]: Found specification of procedure IoDeleteSymbolicLink [2021-10-21 19:38:54,437 INFO L130 BoogieDeclarations]: Found specification of procedure IoQueryDeviceDescription [2021-10-21 19:38:54,437 INFO L130 BoogieDeclarations]: Found specification of procedure IoRegisterDeviceInterface [2021-10-21 19:38:54,437 INFO L130 BoogieDeclarations]: Found specification of procedure IoSetDeviceInterfaceState [2021-10-21 19:38:54,438 INFO L130 BoogieDeclarations]: Found specification of procedure IofCallDriver [2021-10-21 19:38:54,438 INFO L130 BoogieDeclarations]: Found specification of procedure KeSetEvent [2021-10-21 19:38:54,438 INFO L130 BoogieDeclarations]: Found specification of procedure KeWaitForSingleObject [2021-10-21 19:38:54,438 INFO L130 BoogieDeclarations]: Found specification of procedure ObReferenceObjectByHandle [2021-10-21 19:38:54,438 INFO L130 BoogieDeclarations]: Found specification of procedure PsCreateSystemThread [2021-10-21 19:38:54,438 INFO L130 BoogieDeclarations]: Found specification of procedure ZwClose [2021-10-21 19:38:54,438 INFO L130 BoogieDeclarations]: Found specification of procedure IofCompleteRequest [2021-10-21 19:38:54,439 INFO L130 BoogieDeclarations]: Found specification of procedure errorFn [2021-10-21 19:38:54,439 INFO L130 BoogieDeclarations]: Found specification of procedure _BLAST_init [2021-10-21 19:38:54,439 INFO L130 BoogieDeclarations]: Found specification of procedure FloppyProcessQueuedRequests [2021-10-21 19:38:54,439 INFO L130 BoogieDeclarations]: Found specification of procedure stub_driver_init [2021-10-21 19:38:54,440 INFO L130 BoogieDeclarations]: Found specification of procedure main [2021-10-21 19:38:54,440 INFO L130 BoogieDeclarations]: Found specification of procedure stubMoreProcessingRequired [2021-10-21 19:38:54,440 INFO L130 BoogieDeclarations]: Found specification of procedure FloppyCreateClose [2021-10-21 19:38:54,440 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2021-10-21 19:38:54,441 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-10-21 19:38:54,441 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-10-21 19:38:54,441 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-10-21 19:38:54,441 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-10-21 19:38:54,441 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-10-21 19:38:54,751 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-10-21 19:38:54,811 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !false; [2021-10-21 19:38:54,824 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume false; [2021-10-21 19:38:54,832 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-10-21 19:38:54,851 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !false; [2021-10-21 19:38:54,851 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume false; [2021-10-21 19:38:54,857 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-10-21 19:38:55,089 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##21: assume !false; [2021-10-21 19:38:55,089 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##20: assume false; [2021-10-21 19:38:55,094 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-10-21 19:38:55,157 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##10: assume false; [2021-10-21 19:38:55,157 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##11: assume !false; [2021-10-21 19:38:55,171 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-10-21 19:38:55,191 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##16: assume !false; [2021-10-21 19:38:55,192 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##15: assume false; [2021-10-21 19:38:55,288 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-10-21 19:38:55,295 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !false; [2021-10-21 19:38:55,295 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume false; [2021-10-21 19:38:55,296 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-10-21 19:38:55,305 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !false; [2021-10-21 19:38:55,305 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume false; [2021-10-21 19:38:55,306 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-10-21 19:38:55,313 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !false; [2021-10-21 19:38:55,313 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume false; [2021-10-21 19:38:55,348 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-10-21 19:38:55,373 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##12: assume !false; [2021-10-21 19:38:55,374 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##11: assume false; [2021-10-21 19:38:55,408 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-10-21 19:38:55,426 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !false; [2021-10-21 19:38:55,426 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume false; [2021-10-21 19:38:55,427 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-10-21 19:38:55,432 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !false; [2021-10-21 19:38:55,432 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume false; [2021-10-21 19:38:55,433 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-10-21 19:38:55,442 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !false; [2021-10-21 19:38:55,442 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume false; [2021-10-21 19:38:55,472 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-10-21 19:38:55,473 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2021-10-21 19:38:55,493 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.10 07:38:55 BoogieIcfgContainer [2021-10-21 19:38:55,494 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-10-21 19:38:55,496 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-10-21 19:38:55,496 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-10-21 19:38:55,500 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-10-21 19:38:55,501 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.10 07:38:53" (1/3) ... [2021-10-21 19:38:55,502 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7557d4ef and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.10 07:38:55, skipping insertion in model container [2021-10-21 19:38:55,502 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 07:38:54" (2/3) ... [2021-10-21 19:38:55,502 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7557d4ef and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.10 07:38:55, skipping insertion in model container [2021-10-21 19:38:55,503 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.10 07:38:55" (3/3) ... [2021-10-21 19:38:55,504 INFO L111 eAbstractionObserver]: Analyzing ICFG floppy_simpl3.cil-2.c [2021-10-21 19:38:55,510 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-10-21 19:38:55,510 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2021-10-21 19:38:55,564 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-10-21 19:38:55,570 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=false, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2021-10-21 19:38:55,570 INFO L340 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2021-10-21 19:38:55,595 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-10-21 19:38:55,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2021-10-21 19:38:55,602 INFO L504 BasicCegarLoop]: Found error trace [2021-10-21 19:38:55,603 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-21 19:38:55,603 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting mainErr0ENSURES_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2021-10-21 19:38:55,608 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-21 19:38:55,608 INFO L82 PathProgramCache]: Analyzing trace with hash -2120787036, now seen corresponding path program 1 times [2021-10-21 19:38:55,617 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-21 19:38:55,617 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [113856425] [2021-10-21 19:38:55,618 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-21 19:38:55,619 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-21 19:38:55,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:38:55,944 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-10-21 19:38:55,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:38:56,038 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-10-21 19:38:56,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:38:56,058 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-21 19:38:56,059 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-21 19:38:56,060 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [113856425] [2021-10-21 19:38:56,060 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [113856425] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-21 19:38:56,060 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-21 19:38:56,061 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-21 19:38:56,064 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [682986622] [2021-10-21 19:38:56,081 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-21 19:38:56,082 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-21 19:38:56,094 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-21 19:38:56,096 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-10-21 19:38:56,101 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-10-21 19:38:57,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-21 19:38:57,003 INFO L93 Difference]: Finished difference Result 329 states and 449 transitions. [2021-10-21 19:38:57,003 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-21 19:38:57,005 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 2 states have internal predecessors, (10), 1 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 15 [2021-10-21 19:38:57,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-21 19:38:57,019 INFO L225 Difference]: With dead ends: 329 [2021-10-21 19:38:57,019 INFO L226 Difference]: Without dead ends: 322 [2021-10-21 19:38:57,021 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 132.2ms TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-10-21 19:38:57,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 322 states. [2021-10-21 19:38:57,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 322 to 292. [2021-10-21 19:38:57,108 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-10-21 19:38:57,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 292 states to 292 states and 386 transitions. [2021-10-21 19:38:57,115 INFO L78 Accepts]: Start accepts. Automaton has 292 states and 386 transitions. Word has length 15 [2021-10-21 19:38:57,116 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-21 19:38:57,116 INFO L470 AbstractCegarLoop]: Abstraction has 292 states and 386 transitions. [2021-10-21 19:38:57,116 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 2 states have internal predecessors, (10), 1 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2021-10-21 19:38:57,116 INFO L276 IsEmpty]: Start isEmpty. Operand 292 states and 386 transitions. [2021-10-21 19:38:57,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-10-21 19:38:57,118 INFO L504 BasicCegarLoop]: Found error trace [2021-10-21 19:38:57,118 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-21 19:38:57,118 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-10-21 19:38:57,118 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2021-10-21 19:38:57,119 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-21 19:38:57,119 INFO L82 PathProgramCache]: Analyzing trace with hash 1263023814, now seen corresponding path program 1 times [2021-10-21 19:38:57,119 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-21 19:38:57,120 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1763616132] [2021-10-21 19:38:57,120 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-21 19:38:57,120 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-21 19:38:57,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:38:57,332 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-10-21 19:38:57,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:38:57,390 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-10-21 19:38:57,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:38:57,414 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-21 19:38:57,414 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-21 19:38:57,414 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1763616132] [2021-10-21 19:38:57,415 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1763616132] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-21 19:38:57,415 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-21 19:38:57,415 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-10-21 19:38:57,415 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1319110879] [2021-10-21 19:38:57,416 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-10-21 19:38:57,417 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-21 19:38:57,417 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-10-21 19:38:57,417 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-10-21 19:38:57,418 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-10-21 19:38:58,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-21 19:38:58,341 INFO L93 Difference]: Finished difference Result 322 states and 432 transitions. [2021-10-21 19:38:58,342 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-10-21 19:38:58,342 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 3 states have internal predecessors, (14), 3 states have call successors, (4), 4 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 20 [2021-10-21 19:38:58,342 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-21 19:38:58,345 INFO L225 Difference]: With dead ends: 322 [2021-10-21 19:38:58,346 INFO L226 Difference]: Without dead ends: 322 [2021-10-21 19:38:58,346 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 136.6ms TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-10-21 19:38:58,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 322 states. [2021-10-21 19:38:58,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 322 to 292. [2021-10-21 19:38:58,362 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-10-21 19:38:58,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 292 states to 292 states and 385 transitions. [2021-10-21 19:38:58,365 INFO L78 Accepts]: Start accepts. Automaton has 292 states and 385 transitions. Word has length 20 [2021-10-21 19:38:58,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-21 19:38:58,365 INFO L470 AbstractCegarLoop]: Abstraction has 292 states and 385 transitions. [2021-10-21 19:38:58,365 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 3 states have internal predecessors, (14), 3 states have call successors, (4), 4 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-10-21 19:38:58,365 INFO L276 IsEmpty]: Start isEmpty. Operand 292 states and 385 transitions. [2021-10-21 19:38:58,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2021-10-21 19:38:58,366 INFO L504 BasicCegarLoop]: Found error trace [2021-10-21 19:38:58,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] [2021-10-21 19:38:58,367 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-10-21 19:38:58,367 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2021-10-21 19:38:58,367 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-21 19:38:58,368 INFO L82 PathProgramCache]: Analyzing trace with hash 1377431699, now seen corresponding path program 1 times [2021-10-21 19:38:58,368 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-21 19:38:58,368 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1140567181] [2021-10-21 19:38:58,368 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-21 19:38:58,368 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-21 19:38:58,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:38:58,529 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-10-21 19:38:58,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:38:58,562 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-10-21 19:38:58,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:38:58,580 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-10-21 19:38:58,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:38:58,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-10-21 19:38:58,586 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-21 19:38:58,586 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1140567181] [2021-10-21 19:38:58,586 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1140567181] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-21 19:38:58,587 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-21 19:38:58,587 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-10-21 19:38:58,587 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [944379628] [2021-10-21 19:38:58,587 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-10-21 19:38:58,588 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-21 19:38:58,588 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-10-21 19:38:58,588 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2021-10-21 19:38:58,588 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-10-21 19:39:00,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-21 19:39:00,395 INFO L93 Difference]: Finished difference Result 477 states and 636 transitions. [2021-10-21 19:39:00,396 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-10-21 19:39:00,396 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-10-21 19:39:00,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-21 19:39:00,402 INFO L225 Difference]: With dead ends: 477 [2021-10-21 19:39:00,402 INFO L226 Difference]: Without dead ends: 476 [2021-10-21 19:39:00,402 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 249.2ms TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2021-10-21 19:39:00,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 476 states. [2021-10-21 19:39:00,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 476 to 429. [2021-10-21 19:39:00,434 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-10-21 19:39:00,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 429 states to 429 states and 570 transitions. [2021-10-21 19:39:00,443 INFO L78 Accepts]: Start accepts. Automaton has 429 states and 570 transitions. Word has length 28 [2021-10-21 19:39:00,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-21 19:39:00,444 INFO L470 AbstractCegarLoop]: Abstraction has 429 states and 570 transitions. [2021-10-21 19:39:00,444 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-10-21 19:39:00,444 INFO L276 IsEmpty]: Start isEmpty. Operand 429 states and 570 transitions. [2021-10-21 19:39:00,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2021-10-21 19:39:00,445 INFO L504 BasicCegarLoop]: Found error trace [2021-10-21 19:39:00,446 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-21 19:39:00,446 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-10-21 19:39:00,446 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2021-10-21 19:39:00,447 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-21 19:39:00,447 INFO L82 PathProgramCache]: Analyzing trace with hash 1586729981, now seen corresponding path program 1 times [2021-10-21 19:39:00,447 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-21 19:39:00,448 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [613479448] [2021-10-21 19:39:00,448 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-21 19:39:00,448 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-21 19:39:00,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:39:00,595 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-10-21 19:39:00,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:39:00,627 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-10-21 19:39:00,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:39:00,644 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-10-21 19:39:00,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:39:00,650 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-21 19:39:00,650 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-21 19:39:00,650 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [613479448] [2021-10-21 19:39:00,650 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [613479448] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-21 19:39:00,650 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-21 19:39:00,651 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-10-21 19:39:00,651 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [231309211] [2021-10-21 19:39:00,651 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-10-21 19:39:00,651 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-21 19:39:00,652 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-10-21 19:39:00,652 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2021-10-21 19:39:00,652 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-10-21 19:39:01,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-21 19:39:01,563 INFO L93 Difference]: Finished difference Result 675 states and 900 transitions. [2021-10-21 19:39:01,564 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-10-21 19:39:01,564 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-10-21 19:39:01,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-21 19:39:01,576 INFO L225 Difference]: With dead ends: 675 [2021-10-21 19:39:01,577 INFO L226 Difference]: Without dead ends: 675 [2021-10-21 19:39:01,577 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 219.7ms TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2021-10-21 19:39:01,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 675 states. [2021-10-21 19:39:01,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 675 to 632. [2021-10-21 19:39:01,615 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-10-21 19:39:01,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 632 states to 632 states and 845 transitions. [2021-10-21 19:39:01,622 INFO L78 Accepts]: Start accepts. Automaton has 632 states and 845 transitions. Word has length 30 [2021-10-21 19:39:01,622 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-21 19:39:01,622 INFO L470 AbstractCegarLoop]: Abstraction has 632 states and 845 transitions. [2021-10-21 19:39:01,623 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-10-21 19:39:01,623 INFO L276 IsEmpty]: Start isEmpty. Operand 632 states and 845 transitions. [2021-10-21 19:39:01,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2021-10-21 19:39:01,624 INFO L504 BasicCegarLoop]: Found error trace [2021-10-21 19:39:01,624 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-10-21 19:39:01,625 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-10-21 19:39:01,625 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2021-10-21 19:39:01,625 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-21 19:39:01,625 INFO L82 PathProgramCache]: Analyzing trace with hash -962074547, now seen corresponding path program 1 times [2021-10-21 19:39:01,626 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-21 19:39:01,626 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [353762335] [2021-10-21 19:39:01,626 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-21 19:39:01,626 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-21 19:39:01,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:39:01,798 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-10-21 19:39:01,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:39:01,840 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-10-21 19:39:01,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:39:01,859 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-10-21 19:39:01,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:39:01,866 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-21 19:39:01,867 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-21 19:39:01,867 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [353762335] [2021-10-21 19:39:01,867 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [353762335] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-21 19:39:01,867 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-21 19:39:01,867 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-10-21 19:39:01,868 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [466509283] [2021-10-21 19:39:01,868 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-10-21 19:39:01,868 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-21 19:39:01,869 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-10-21 19:39:01,870 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2021-10-21 19:39:01,870 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-10-21 19:39:02,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-21 19:39:02,891 INFO L93 Difference]: Finished difference Result 721 states and 953 transitions. [2021-10-21 19:39:02,892 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-10-21 19:39:02,893 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-10-21 19:39:02,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-21 19:39:02,898 INFO L225 Difference]: With dead ends: 721 [2021-10-21 19:39:02,898 INFO L226 Difference]: Without dead ends: 721 [2021-10-21 19:39:02,898 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 222.6ms TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2021-10-21 19:39:02,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 721 states. [2021-10-21 19:39:02,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 721 to 670. [2021-10-21 19:39:02,924 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-10-21 19:39:02,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 670 states to 670 states and 894 transitions. [2021-10-21 19:39:02,930 INFO L78 Accepts]: Start accepts. Automaton has 670 states and 894 transitions. Word has length 34 [2021-10-21 19:39:02,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-21 19:39:02,930 INFO L470 AbstractCegarLoop]: Abstraction has 670 states and 894 transitions. [2021-10-21 19:39:02,930 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-10-21 19:39:02,931 INFO L276 IsEmpty]: Start isEmpty. Operand 670 states and 894 transitions. [2021-10-21 19:39:02,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2021-10-21 19:39:02,933 INFO L504 BasicCegarLoop]: Found error trace [2021-10-21 19:39:02,934 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-21 19:39:02,934 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-10-21 19:39:02,934 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2021-10-21 19:39:02,934 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-21 19:39:02,935 INFO L82 PathProgramCache]: Analyzing trace with hash 82742685, now seen corresponding path program 1 times [2021-10-21 19:39:02,935 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-21 19:39:02,935 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [124809154] [2021-10-21 19:39:02,935 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-21 19:39:02,935 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-21 19:39:02,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:39:03,094 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-10-21 19:39:03,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:39:03,158 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-10-21 19:39:03,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:39:03,184 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-10-21 19:39:03,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:39:03,196 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2021-10-21 19:39:03,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:39:03,213 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-21 19:39:03,213 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-21 19:39:03,213 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [124809154] [2021-10-21 19:39:03,213 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [124809154] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-21 19:39:03,213 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-21 19:39:03,214 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-10-21 19:39:03,214 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [859813138] [2021-10-21 19:39:03,214 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-10-21 19:39:03,214 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-21 19:39:03,215 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-10-21 19:39:03,215 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2021-10-21 19:39:03,215 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-10-21 19:39:04,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-21 19:39:04,591 INFO L93 Difference]: Finished difference Result 696 states and 924 transitions. [2021-10-21 19:39:04,592 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-10-21 19:39:04,592 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-10-21 19:39:04,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-21 19:39:04,597 INFO L225 Difference]: With dead ends: 696 [2021-10-21 19:39:04,597 INFO L226 Difference]: Without dead ends: 696 [2021-10-21 19:39:04,597 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 233.1ms TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2021-10-21 19:39:04,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 696 states. [2021-10-21 19:39:04,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 696 to 674. [2021-10-21 19:39:04,622 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-10-21 19:39:04,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 674 states to 674 states and 898 transitions. [2021-10-21 19:39:04,627 INFO L78 Accepts]: Start accepts. Automaton has 674 states and 898 transitions. Word has length 41 [2021-10-21 19:39:04,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-21 19:39:04,628 INFO L470 AbstractCegarLoop]: Abstraction has 674 states and 898 transitions. [2021-10-21 19:39:04,628 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-10-21 19:39:04,628 INFO L276 IsEmpty]: Start isEmpty. Operand 674 states and 898 transitions. [2021-10-21 19:39:04,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2021-10-21 19:39:04,630 INFO L504 BasicCegarLoop]: Found error trace [2021-10-21 19:39:04,630 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-21 19:39:04,630 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-10-21 19:39:04,630 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2021-10-21 19:39:04,631 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-21 19:39:04,631 INFO L82 PathProgramCache]: Analyzing trace with hash -127535261, now seen corresponding path program 1 times [2021-10-21 19:39:04,631 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-21 19:39:04,631 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1161690314] [2021-10-21 19:39:04,631 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-21 19:39:04,632 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-21 19:39:04,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:39:04,772 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-10-21 19:39:04,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:39:04,807 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-10-21 19:39:04,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:39:04,826 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-10-21 19:39:04,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:39:04,830 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-21 19:39:04,830 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-21 19:39:04,831 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1161690314] [2021-10-21 19:39:04,831 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1161690314] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-21 19:39:04,831 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-21 19:39:04,831 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-10-21 19:39:04,831 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [818309151] [2021-10-21 19:39:04,832 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-10-21 19:39:04,832 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-21 19:39:04,832 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-10-21 19:39:04,833 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2021-10-21 19:39:04,833 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-10-21 19:39:05,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-21 19:39:05,758 INFO L93 Difference]: Finished difference Result 698 states and 928 transitions. [2021-10-21 19:39:05,759 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-10-21 19:39:05,759 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-10-21 19:39:05,759 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-21 19:39:05,764 INFO L225 Difference]: With dead ends: 698 [2021-10-21 19:39:05,765 INFO L226 Difference]: Without dead ends: 698 [2021-10-21 19:39:05,765 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 206.1ms TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2021-10-21 19:39:05,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 698 states. [2021-10-21 19:39:05,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 698 to 685. [2021-10-21 19:39:05,790 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-10-21 19:39:05,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 685 states to 685 states and 912 transitions. [2021-10-21 19:39:05,797 INFO L78 Accepts]: Start accepts. Automaton has 685 states and 912 transitions. Word has length 40 [2021-10-21 19:39:05,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-21 19:39:05,798 INFO L470 AbstractCegarLoop]: Abstraction has 685 states and 912 transitions. [2021-10-21 19:39:05,798 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-10-21 19:39:05,798 INFO L276 IsEmpty]: Start isEmpty. Operand 685 states and 912 transitions. [2021-10-21 19:39:05,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2021-10-21 19:39:05,800 INFO L504 BasicCegarLoop]: Found error trace [2021-10-21 19:39:05,800 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-21 19:39:05,800 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-10-21 19:39:05,800 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2021-10-21 19:39:05,801 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-21 19:39:05,801 INFO L82 PathProgramCache]: Analyzing trace with hash -1411662583, now seen corresponding path program 1 times [2021-10-21 19:39:05,801 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-21 19:39:05,802 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [863190634] [2021-10-21 19:39:05,802 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-21 19:39:05,802 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-21 19:39:05,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:39:05,951 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-10-21 19:39:05,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:39:05,997 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-10-21 19:39:05,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:39:06,024 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-10-21 19:39:06,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:39:06,047 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-10-21 19:39:06,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:39:06,082 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-10-21 19:39:06,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:39:06,090 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-21 19:39:06,090 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-21 19:39:06,090 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [863190634] [2021-10-21 19:39:06,091 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [863190634] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-21 19:39:06,091 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-21 19:39:06,091 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-10-21 19:39:06,091 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1289635047] [2021-10-21 19:39:06,092 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-10-21 19:39:06,092 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-21 19:39:06,093 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-10-21 19:39:06,093 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2021-10-21 19:39:06,093 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-10-21 19:39:07,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-21 19:39:07,385 INFO L93 Difference]: Finished difference Result 747 states and 988 transitions. [2021-10-21 19:39:07,386 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-10-21 19:39:07,386 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-10-21 19:39:07,386 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-21 19:39:07,391 INFO L225 Difference]: With dead ends: 747 [2021-10-21 19:39:07,391 INFO L226 Difference]: Without dead ends: 747 [2021-10-21 19:39:07,391 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 243.9ms TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2021-10-21 19:39:07,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 747 states. [2021-10-21 19:39:07,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 747 to 718. [2021-10-21 19:39:07,414 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-10-21 19:39:07,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 718 states to 718 states and 951 transitions. [2021-10-21 19:39:07,419 INFO L78 Accepts]: Start accepts. Automaton has 718 states and 951 transitions. Word has length 41 [2021-10-21 19:39:07,419 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-21 19:39:07,420 INFO L470 AbstractCegarLoop]: Abstraction has 718 states and 951 transitions. [2021-10-21 19:39:07,420 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-10-21 19:39:07,420 INFO L276 IsEmpty]: Start isEmpty. Operand 718 states and 951 transitions. [2021-10-21 19:39:07,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2021-10-21 19:39:07,421 INFO L504 BasicCegarLoop]: Found error trace [2021-10-21 19:39:07,421 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-21 19:39:07,422 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-10-21 19:39:07,422 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2021-10-21 19:39:07,423 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-21 19:39:07,423 INFO L82 PathProgramCache]: Analyzing trace with hash -359990476, now seen corresponding path program 1 times [2021-10-21 19:39:07,423 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-21 19:39:07,423 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1266035401] [2021-10-21 19:39:07,423 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-21 19:39:07,424 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-21 19:39:07,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:39:07,595 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-10-21 19:39:07,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:39:07,638 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-10-21 19:39:07,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:39:07,675 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-10-21 19:39:07,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:39:07,714 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-10-21 19:39:07,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:39:07,770 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-10-21 19:39:07,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:39:07,794 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-21 19:39:07,795 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-21 19:39:07,796 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1266035401] [2021-10-21 19:39:07,796 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1266035401] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-21 19:39:07,797 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-21 19:39:07,797 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-10-21 19:39:07,797 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [932053218] [2021-10-21 19:39:07,799 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-10-21 19:39:07,799 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-21 19:39:07,799 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-10-21 19:39:07,800 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2021-10-21 19:39:07,800 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-10-21 19:39:09,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-21 19:39:09,369 INFO L93 Difference]: Finished difference Result 747 states and 987 transitions. [2021-10-21 19:39:09,369 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-10-21 19:39:09,370 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-10-21 19:39:09,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-21 19:39:09,375 INFO L225 Difference]: With dead ends: 747 [2021-10-21 19:39:09,375 INFO L226 Difference]: Without dead ends: 747 [2021-10-21 19:39:09,378 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 607.2ms TimeCoverageRelationStatistics Valid=90, Invalid=216, Unknown=0, NotChecked=0, Total=306 [2021-10-21 19:39:09,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 747 states. [2021-10-21 19:39:09,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 747 to 718. [2021-10-21 19:39:09,400 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-10-21 19:39:09,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 718 states to 718 states and 950 transitions. [2021-10-21 19:39:09,406 INFO L78 Accepts]: Start accepts. Automaton has 718 states and 950 transitions. Word has length 42 [2021-10-21 19:39:09,406 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-21 19:39:09,407 INFO L470 AbstractCegarLoop]: Abstraction has 718 states and 950 transitions. [2021-10-21 19:39:09,408 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-10-21 19:39:09,408 INFO L276 IsEmpty]: Start isEmpty. Operand 718 states and 950 transitions. [2021-10-21 19:39:09,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2021-10-21 19:39:09,409 INFO L504 BasicCegarLoop]: Found error trace [2021-10-21 19:39:09,409 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-21 19:39:09,410 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-10-21 19:39:09,410 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2021-10-21 19:39:09,410 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-21 19:39:09,410 INFO L82 PathProgramCache]: Analyzing trace with hash 864804566, now seen corresponding path program 1 times [2021-10-21 19:39:09,411 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-21 19:39:09,411 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1157894090] [2021-10-21 19:39:09,411 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-21 19:39:09,411 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-21 19:39:09,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:39:09,540 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-10-21 19:39:09,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:39:09,583 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-10-21 19:39:09,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:39:09,620 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-10-21 19:39:09,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:39:09,646 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-10-21 19:39:09,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:39:09,694 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-10-21 19:39:09,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:39:09,725 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-21 19:39:09,726 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-21 19:39:09,726 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1157894090] [2021-10-21 19:39:09,726 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1157894090] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-21 19:39:09,726 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-21 19:39:09,727 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-10-21 19:39:09,727 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1627429344] [2021-10-21 19:39:09,727 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-10-21 19:39:09,727 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-21 19:39:09,728 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-10-21 19:39:09,728 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2021-10-21 19:39:09,728 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-10-21 19:39:11,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-21 19:39:11,046 INFO L93 Difference]: Finished difference Result 747 states and 986 transitions. [2021-10-21 19:39:11,046 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-10-21 19:39:11,046 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-10-21 19:39:11,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-21 19:39:11,053 INFO L225 Difference]: With dead ends: 747 [2021-10-21 19:39:11,053 INFO L226 Difference]: Without dead ends: 747 [2021-10-21 19:39:11,054 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 570.9ms TimeCoverageRelationStatistics Valid=90, Invalid=216, Unknown=0, NotChecked=0, Total=306 [2021-10-21 19:39:11,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 747 states. [2021-10-21 19:39:11,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 747 to 718. [2021-10-21 19:39:11,074 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-10-21 19:39:11,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 718 states to 718 states and 949 transitions. [2021-10-21 19:39:11,077 INFO L78 Accepts]: Start accepts. Automaton has 718 states and 949 transitions. Word has length 43 [2021-10-21 19:39:11,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-21 19:39:11,078 INFO L470 AbstractCegarLoop]: Abstraction has 718 states and 949 transitions. [2021-10-21 19:39:11,078 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-10-21 19:39:11,078 INFO L276 IsEmpty]: Start isEmpty. Operand 718 states and 949 transitions. [2021-10-21 19:39:11,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2021-10-21 19:39:11,080 INFO L504 BasicCegarLoop]: Found error trace [2021-10-21 19:39:11,080 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-21 19:39:11,080 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-10-21 19:39:11,081 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2021-10-21 19:39:11,082 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-21 19:39:11,082 INFO L82 PathProgramCache]: Analyzing trace with hash 484799798, now seen corresponding path program 1 times [2021-10-21 19:39:11,082 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-21 19:39:11,084 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1978463065] [2021-10-21 19:39:11,084 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-21 19:39:11,085 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-21 19:39:11,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:39:11,217 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-10-21 19:39:11,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:39:11,256 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-10-21 19:39:11,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:39:11,276 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-10-21 19:39:11,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:39:11,290 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2021-10-21 19:39:11,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:39:11,296 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-21 19:39:11,296 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-21 19:39:11,296 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1978463065] [2021-10-21 19:39:11,296 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1978463065] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-21 19:39:11,296 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-21 19:39:11,297 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-10-21 19:39:11,297 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [676289386] [2021-10-21 19:39:11,297 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-10-21 19:39:11,297 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-21 19:39:11,298 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-10-21 19:39:11,298 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2021-10-21 19:39:11,298 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-10-21 19:39:12,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-21 19:39:12,792 INFO L93 Difference]: Finished difference Result 1090 states and 1456 transitions. [2021-10-21 19:39:12,792 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-10-21 19:39:12,792 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-10-21 19:39:12,792 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-21 19:39:12,799 INFO L225 Difference]: With dead ends: 1090 [2021-10-21 19:39:12,799 INFO L226 Difference]: Without dead ends: 1090 [2021-10-21 19:39:12,800 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 241.0ms TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2021-10-21 19:39:12,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1090 states. [2021-10-21 19:39:12,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1090 to 831. [2021-10-21 19:39:12,829 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-10-21 19:39:12,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 831 states to 831 states and 1103 transitions. [2021-10-21 19:39:12,833 INFO L78 Accepts]: Start accepts. Automaton has 831 states and 1103 transitions. Word has length 44 [2021-10-21 19:39:12,833 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-21 19:39:12,833 INFO L470 AbstractCegarLoop]: Abstraction has 831 states and 1103 transitions. [2021-10-21 19:39:12,834 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-10-21 19:39:12,835 INFO L276 IsEmpty]: Start isEmpty. Operand 831 states and 1103 transitions. [2021-10-21 19:39:12,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2021-10-21 19:39:12,837 INFO L504 BasicCegarLoop]: Found error trace [2021-10-21 19:39:12,837 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-21 19:39:12,837 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-10-21 19:39:12,837 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2021-10-21 19:39:12,838 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-21 19:39:12,838 INFO L82 PathProgramCache]: Analyzing trace with hash 1122912541, now seen corresponding path program 1 times [2021-10-21 19:39:12,838 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-21 19:39:12,838 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [319783851] [2021-10-21 19:39:12,838 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-21 19:39:12,838 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-21 19:39:12,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:39:12,971 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-10-21 19:39:12,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:39:13,015 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-10-21 19:39:13,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:39:13,035 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-10-21 19:39:13,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:39:13,058 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-10-21 19:39:13,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:39:13,085 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-10-21 19:39:13,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:39:13,088 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-21 19:39:13,088 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-21 19:39:13,089 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [319783851] [2021-10-21 19:39:13,089 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [319783851] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-21 19:39:13,089 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-21 19:39:13,089 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-10-21 19:39:13,089 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1999771463] [2021-10-21 19:39:13,090 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-10-21 19:39:13,090 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-21 19:39:13,090 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-10-21 19:39:13,091 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2021-10-21 19:39:13,091 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-10-21 19:39:14,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-21 19:39:14,408 INFO L93 Difference]: Finished difference Result 871 states and 1151 transitions. [2021-10-21 19:39:14,409 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-10-21 19:39:14,409 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-10-21 19:39:14,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-21 19:39:14,414 INFO L225 Difference]: With dead ends: 871 [2021-10-21 19:39:14,414 INFO L226 Difference]: Without dead ends: 856 [2021-10-21 19:39:14,415 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 164.5ms TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2021-10-21 19:39:14,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 856 states. [2021-10-21 19:39:14,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 856 to 829. [2021-10-21 19:39:14,438 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-10-21 19:39:14,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 829 states to 829 states and 1099 transitions. [2021-10-21 19:39:14,442 INFO L78 Accepts]: Start accepts. Automaton has 829 states and 1099 transitions. Word has length 44 [2021-10-21 19:39:14,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-21 19:39:14,443 INFO L470 AbstractCegarLoop]: Abstraction has 829 states and 1099 transitions. [2021-10-21 19:39:14,443 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-10-21 19:39:14,443 INFO L276 IsEmpty]: Start isEmpty. Operand 829 states and 1099 transitions. [2021-10-21 19:39:14,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2021-10-21 19:39:14,444 INFO L504 BasicCegarLoop]: Found error trace [2021-10-21 19:39:14,444 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-21 19:39:14,445 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-10-21 19:39:14,445 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2021-10-21 19:39:14,445 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-21 19:39:14,445 INFO L82 PathProgramCache]: Analyzing trace with hash 1906062941, now seen corresponding path program 1 times [2021-10-21 19:39:14,446 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-21 19:39:14,446 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [649092172] [2021-10-21 19:39:14,446 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-21 19:39:14,446 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-21 19:39:14,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:39:14,616 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-10-21 19:39:14,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:39:14,655 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-10-21 19:39:14,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:39:14,699 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-10-21 19:39:14,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:39:14,753 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2021-10-21 19:39:14,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:39:14,762 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-21 19:39:14,762 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-21 19:39:14,762 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [649092172] [2021-10-21 19:39:14,763 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [649092172] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-21 19:39:14,763 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-21 19:39:14,763 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-10-21 19:39:14,763 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2061013487] [2021-10-21 19:39:14,764 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-10-21 19:39:14,764 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-21 19:39:14,765 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-10-21 19:39:14,765 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2021-10-21 19:39:14,765 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-10-21 19:39:16,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-21 19:39:16,363 INFO L93 Difference]: Finished difference Result 874 states and 1141 transitions. [2021-10-21 19:39:16,364 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-10-21 19:39:16,364 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-10-21 19:39:16,364 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-21 19:39:16,369 INFO L225 Difference]: With dead ends: 874 [2021-10-21 19:39:16,369 INFO L226 Difference]: Without dead ends: 874 [2021-10-21 19:39:16,370 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 642.6ms TimeCoverageRelationStatistics Valid=84, Invalid=188, Unknown=0, NotChecked=0, Total=272 [2021-10-21 19:39:16,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 874 states. [2021-10-21 19:39:16,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 874 to 820. [2021-10-21 19:39:16,395 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-10-21 19:39:16,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 820 states to 820 states and 1078 transitions. [2021-10-21 19:39:16,399 INFO L78 Accepts]: Start accepts. Automaton has 820 states and 1078 transitions. Word has length 45 [2021-10-21 19:39:16,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-21 19:39:16,399 INFO L470 AbstractCegarLoop]: Abstraction has 820 states and 1078 transitions. [2021-10-21 19:39:16,400 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-10-21 19:39:16,400 INFO L276 IsEmpty]: Start isEmpty. Operand 820 states and 1078 transitions. [2021-10-21 19:39:16,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2021-10-21 19:39:16,401 INFO L504 BasicCegarLoop]: Found error trace [2021-10-21 19:39:16,401 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-21 19:39:16,401 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-10-21 19:39:16,402 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2021-10-21 19:39:16,402 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-21 19:39:16,402 INFO L82 PathProgramCache]: Analyzing trace with hash 1924856002, now seen corresponding path program 1 times [2021-10-21 19:39:16,402 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-21 19:39:16,402 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [511604779] [2021-10-21 19:39:16,403 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-21 19:39:16,403 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-21 19:39:16,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:39:16,522 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-10-21 19:39:16,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:39:16,550 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-10-21 19:39:16,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:39:16,567 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-10-21 19:39:16,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:39:16,580 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2021-10-21 19:39:16,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:39:16,594 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-21 19:39:16,594 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-21 19:39:16,594 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [511604779] [2021-10-21 19:39:16,594 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [511604779] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-21 19:39:16,595 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-21 19:39:16,595 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-10-21 19:39:16,595 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1263142618] [2021-10-21 19:39:16,595 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-10-21 19:39:16,595 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-21 19:39:16,596 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-10-21 19:39:16,596 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2021-10-21 19:39:16,596 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-10-21 19:39:18,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-21 19:39:18,177 INFO L93 Difference]: Finished difference Result 580 states and 730 transitions. [2021-10-21 19:39:18,177 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-10-21 19:39:18,177 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-10-21 19:39:18,177 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-21 19:39:18,180 INFO L225 Difference]: With dead ends: 580 [2021-10-21 19:39:18,180 INFO L226 Difference]: Without dead ends: 580 [2021-10-21 19:39:18,181 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 335.3ms TimeCoverageRelationStatistics Valid=51, Invalid=105, Unknown=0, NotChecked=0, Total=156 [2021-10-21 19:39:18,182 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 580 states. [2021-10-21 19:39:18,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 580 to 528. [2021-10-21 19:39:18,197 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-10-21 19:39:18,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 528 states to 528 states and 667 transitions. [2021-10-21 19:39:18,200 INFO L78 Accepts]: Start accepts. Automaton has 528 states and 667 transitions. Word has length 49 [2021-10-21 19:39:18,201 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-21 19:39:18,201 INFO L470 AbstractCegarLoop]: Abstraction has 528 states and 667 transitions. [2021-10-21 19:39:18,201 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-10-21 19:39:18,201 INFO L276 IsEmpty]: Start isEmpty. Operand 528 states and 667 transitions. [2021-10-21 19:39:18,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2021-10-21 19:39:18,203 INFO L504 BasicCegarLoop]: Found error trace [2021-10-21 19:39:18,203 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-21 19:39:18,203 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-10-21 19:39:18,203 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2021-10-21 19:39:18,204 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-21 19:39:18,204 INFO L82 PathProgramCache]: Analyzing trace with hash -6834350, now seen corresponding path program 1 times [2021-10-21 19:39:18,204 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-21 19:39:18,204 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1420669832] [2021-10-21 19:39:18,205 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-21 19:39:18,205 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-21 19:39:18,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:39:18,332 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-10-21 19:39:18,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:39:18,363 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-10-21 19:39:18,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:39:18,379 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-10-21 19:39:18,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:39:18,390 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2021-10-21 19:39:18,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:39:18,394 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-10-21 19:39:18,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:39:18,404 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2021-10-21 19:39:18,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:39:18,408 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-21 19:39:18,409 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-21 19:39:18,409 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1420669832] [2021-10-21 19:39:18,409 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1420669832] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-21 19:39:18,409 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-21 19:39:18,409 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-10-21 19:39:18,410 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2103657939] [2021-10-21 19:39:18,410 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-10-21 19:39:18,410 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-21 19:39:18,411 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-10-21 19:39:18,411 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2021-10-21 19:39:18,411 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-10-21 19:39:19,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-21 19:39:19,211 INFO L93 Difference]: Finished difference Result 569 states and 720 transitions. [2021-10-21 19:39:19,211 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-10-21 19:39:19,212 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-10-21 19:39:19,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-21 19:39:19,214 INFO L225 Difference]: With dead ends: 569 [2021-10-21 19:39:19,215 INFO L226 Difference]: Without dead ends: 569 [2021-10-21 19:39:19,215 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 216.0ms TimeCoverageRelationStatistics Valid=48, Invalid=84, Unknown=0, NotChecked=0, Total=132 [2021-10-21 19:39:19,216 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 569 states. [2021-10-21 19:39:19,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 569 to 542. [2021-10-21 19:39:19,229 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-10-21 19:39:19,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 542 states to 542 states and 687 transitions. [2021-10-21 19:39:19,231 INFO L78 Accepts]: Start accepts. Automaton has 542 states and 687 transitions. Word has length 55 [2021-10-21 19:39:19,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-21 19:39:19,232 INFO L470 AbstractCegarLoop]: Abstraction has 542 states and 687 transitions. [2021-10-21 19:39:19,232 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-10-21 19:39:19,232 INFO L276 IsEmpty]: Start isEmpty. Operand 542 states and 687 transitions. [2021-10-21 19:39:19,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2021-10-21 19:39:19,234 INFO L504 BasicCegarLoop]: Found error trace [2021-10-21 19:39:19,234 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-21 19:39:19,234 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-10-21 19:39:19,234 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2021-10-21 19:39:19,234 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-21 19:39:19,235 INFO L82 PathProgramCache]: Analyzing trace with hash -2114913751, now seen corresponding path program 1 times [2021-10-21 19:39:19,235 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-21 19:39:19,235 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [778520630] [2021-10-21 19:39:19,235 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-21 19:39:19,235 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-21 19:39:19,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:39:19,363 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-10-21 19:39:19,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:39:19,392 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-10-21 19:39:19,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:39:19,412 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-10-21 19:39:19,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:39:19,435 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-10-21 19:39:19,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:39:19,484 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-10-21 19:39:19,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:39:19,509 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-21 19:39:19,510 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-21 19:39:19,510 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [778520630] [2021-10-21 19:39:19,510 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [778520630] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-21 19:39:19,510 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-21 19:39:19,510 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-10-21 19:39:19,511 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1855969047] [2021-10-21 19:39:19,511 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-10-21 19:39:19,511 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-21 19:39:19,512 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-10-21 19:39:19,512 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2021-10-21 19:39:19,512 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-10-21 19:39:21,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-21 19:39:21,478 INFO L93 Difference]: Finished difference Result 714 states and 903 transitions. [2021-10-21 19:39:21,478 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2021-10-21 19:39:21,479 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.3333333333333335) internal successors, (40), 7 states have internal predecessors, (40), 4 states have call successors, (7), 7 states have call predecessors, (7), 4 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) Word has length 52 [2021-10-21 19:39:21,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-21 19:39:21,482 INFO L225 Difference]: With dead ends: 714 [2021-10-21 19:39:21,482 INFO L226 Difference]: Without dead ends: 714 [2021-10-21 19:39:21,482 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 121 ImplicationChecksByTransitivity, 794.6ms TimeCoverageRelationStatistics Valid=160, Invalid=490, Unknown=0, NotChecked=0, Total=650 [2021-10-21 19:39:21,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 714 states. [2021-10-21 19:39:21,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 714 to 571. [2021-10-21 19:39:21,498 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-10-21 19:39:21,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 571 states to 571 states and 720 transitions. [2021-10-21 19:39:21,501 INFO L78 Accepts]: Start accepts. Automaton has 571 states and 720 transitions. Word has length 52 [2021-10-21 19:39:21,501 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-21 19:39:21,501 INFO L470 AbstractCegarLoop]: Abstraction has 571 states and 720 transitions. [2021-10-21 19:39:21,502 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.3333333333333335) internal successors, (40), 7 states have internal predecessors, (40), 4 states have call successors, (7), 7 states have call predecessors, (7), 4 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) [2021-10-21 19:39:21,502 INFO L276 IsEmpty]: Start isEmpty. Operand 571 states and 720 transitions. [2021-10-21 19:39:21,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2021-10-21 19:39:21,503 INFO L504 BasicCegarLoop]: Found error trace [2021-10-21 19:39:21,503 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-21 19:39:21,503 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-10-21 19:39:21,504 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2021-10-21 19:39:21,504 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-21 19:39:21,504 INFO L82 PathProgramCache]: Analyzing trace with hash -632991762, now seen corresponding path program 1 times [2021-10-21 19:39:21,504 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-21 19:39:21,505 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1931388973] [2021-10-21 19:39:21,505 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-21 19:39:21,505 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-21 19:39:21,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:39:21,611 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-10-21 19:39:21,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:39:21,641 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-10-21 19:39:21,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:39:21,656 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-10-21 19:39:21,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:39:21,673 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-10-21 19:39:21,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:39:21,699 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-10-21 19:39:21,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:39:21,718 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-21 19:39:21,718 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-21 19:39:21,719 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1931388973] [2021-10-21 19:39:21,719 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1931388973] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-21 19:39:21,719 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-21 19:39:21,719 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-10-21 19:39:21,719 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [57796623] [2021-10-21 19:39:21,720 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-10-21 19:39:21,720 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-21 19:39:21,721 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-10-21 19:39:21,721 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2021-10-21 19:39:21,721 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-10-21 19:39:22,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-21 19:39:22,529 INFO L93 Difference]: Finished difference Result 638 states and 811 transitions. [2021-10-21 19:39:22,529 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-10-21 19:39:22,529 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-10-21 19:39:22,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-21 19:39:22,532 INFO L225 Difference]: With dead ends: 638 [2021-10-21 19:39:22,533 INFO L226 Difference]: Without dead ends: 638 [2021-10-21 19:39:22,533 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 198.4ms TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2021-10-21 19:39:22,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 638 states. [2021-10-21 19:39:22,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 638 to 583. [2021-10-21 19:39:22,548 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-10-21 19:39:22,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 583 states to 583 states and 737 transitions. [2021-10-21 19:39:22,551 INFO L78 Accepts]: Start accepts. Automaton has 583 states and 737 transitions. Word has length 54 [2021-10-21 19:39:22,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-21 19:39:22,551 INFO L470 AbstractCegarLoop]: Abstraction has 583 states and 737 transitions. [2021-10-21 19:39:22,552 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-10-21 19:39:22,552 INFO L276 IsEmpty]: Start isEmpty. Operand 583 states and 737 transitions. [2021-10-21 19:39:22,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2021-10-21 19:39:22,553 INFO L504 BasicCegarLoop]: Found error trace [2021-10-21 19:39:22,554 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-21 19:39:22,554 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-10-21 19:39:22,554 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2021-10-21 19:39:22,554 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-21 19:39:22,554 INFO L82 PathProgramCache]: Analyzing trace with hash 2073627632, now seen corresponding path program 1 times [2021-10-21 19:39:22,555 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-21 19:39:22,555 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [41870578] [2021-10-21 19:39:22,555 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-21 19:39:22,555 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-21 19:39:22,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:39:22,670 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-10-21 19:39:22,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:39:22,698 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-10-21 19:39:22,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:39:22,720 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-10-21 19:39:22,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:39:22,744 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-10-21 19:39:22,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:39:22,795 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-10-21 19:39:22,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:39:22,820 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-21 19:39:22,820 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-21 19:39:22,820 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [41870578] [2021-10-21 19:39:22,821 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [41870578] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-21 19:39:22,821 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-21 19:39:22,821 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-10-21 19:39:22,821 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [655747840] [2021-10-21 19:39:22,823 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-10-21 19:39:22,823 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-21 19:39:22,824 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-10-21 19:39:22,824 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2021-10-21 19:39:22,824 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-10-21 19:39:24,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-21 19:39:24,304 INFO L93 Difference]: Finished difference Result 611 states and 769 transitions. [2021-10-21 19:39:24,304 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-10-21 19:39:24,304 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-10-21 19:39:24,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-21 19:39:24,307 INFO L225 Difference]: With dead ends: 611 [2021-10-21 19:39:24,308 INFO L226 Difference]: Without dead ends: 611 [2021-10-21 19:39:24,308 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 532.6ms TimeCoverageRelationStatistics Valid=112, Invalid=350, Unknown=0, NotChecked=0, Total=462 [2021-10-21 19:39:24,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 611 states. [2021-10-21 19:39:24,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 611 to 564. [2021-10-21 19:39:24,322 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-10-21 19:39:24,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 564 states to 564 states and 711 transitions. [2021-10-21 19:39:24,325 INFO L78 Accepts]: Start accepts. Automaton has 564 states and 711 transitions. Word has length 54 [2021-10-21 19:39:24,325 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-21 19:39:24,325 INFO L470 AbstractCegarLoop]: Abstraction has 564 states and 711 transitions. [2021-10-21 19:39:24,326 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-10-21 19:39:24,326 INFO L276 IsEmpty]: Start isEmpty. Operand 564 states and 711 transitions. [2021-10-21 19:39:24,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2021-10-21 19:39:24,327 INFO L504 BasicCegarLoop]: Found error trace [2021-10-21 19:39:24,327 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-21 19:39:24,328 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2021-10-21 19:39:24,328 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2021-10-21 19:39:24,328 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-21 19:39:24,328 INFO L82 PathProgramCache]: Analyzing trace with hash -2078060306, now seen corresponding path program 1 times [2021-10-21 19:39:24,328 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-21 19:39:24,329 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1204985446] [2021-10-21 19:39:24,329 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-21 19:39:24,329 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-21 19:39:24,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:39:24,439 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-10-21 19:39:24,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:39:24,469 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-10-21 19:39:24,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:39:24,486 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-10-21 19:39:24,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:39:24,505 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-10-21 19:39:24,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:39:24,529 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-10-21 19:39:24,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:39:24,538 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-21 19:39:24,539 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-21 19:39:24,539 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1204985446] [2021-10-21 19:39:24,539 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1204985446] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-21 19:39:24,539 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-21 19:39:24,539 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-10-21 19:39:24,539 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1240052289] [2021-10-21 19:39:24,541 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-10-21 19:39:24,541 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-21 19:39:24,541 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-10-21 19:39:24,542 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2021-10-21 19:39:24,542 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-10-21 19:39:25,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-21 19:39:25,876 INFO L93 Difference]: Finished difference Result 666 states and 840 transitions. [2021-10-21 19:39:25,877 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-10-21 19:39:25,877 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-10-21 19:39:25,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-21 19:39:25,880 INFO L225 Difference]: With dead ends: 666 [2021-10-21 19:39:25,880 INFO L226 Difference]: Without dead ends: 666 [2021-10-21 19:39:25,882 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 213.5ms TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2021-10-21 19:39:25,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 666 states. [2021-10-21 19:39:25,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 666 to 580. [2021-10-21 19:39:25,896 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-10-21 19:39:25,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 580 states to 580 states and 733 transitions. [2021-10-21 19:39:25,899 INFO L78 Accepts]: Start accepts. Automaton has 580 states and 733 transitions. Word has length 54 [2021-10-21 19:39:25,899 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-21 19:39:25,899 INFO L470 AbstractCegarLoop]: Abstraction has 580 states and 733 transitions. [2021-10-21 19:39:25,900 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-10-21 19:39:25,900 INFO L276 IsEmpty]: Start isEmpty. Operand 580 states and 733 transitions. [2021-10-21 19:39:25,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2021-10-21 19:39:25,903 INFO L504 BasicCegarLoop]: Found error trace [2021-10-21 19:39:25,904 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-10-21 19:39:25,904 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2021-10-21 19:39:25,904 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2021-10-21 19:39:25,904 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-21 19:39:25,904 INFO L82 PathProgramCache]: Analyzing trace with hash 2007283295, now seen corresponding path program 1 times [2021-10-21 19:39:25,905 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-21 19:39:25,905 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [796319507] [2021-10-21 19:39:25,905 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-21 19:39:25,905 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-21 19:39:25,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:39:26,052 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-10-21 19:39:26,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:39:26,091 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-10-21 19:39:26,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:39:26,111 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-10-21 19:39:26,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:39:26,125 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2021-10-21 19:39:26,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:39:26,223 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-10-21 19:39:26,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:39:26,245 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-10-21 19:39:26,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:39:26,248 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-21 19:39:26,249 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-21 19:39:26,249 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [796319507] [2021-10-21 19:39:26,249 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [796319507] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-21 19:39:26,249 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-21 19:39:26,249 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-10-21 19:39:26,250 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1609364552] [2021-10-21 19:39:26,250 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-10-21 19:39:26,250 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-21 19:39:26,251 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-10-21 19:39:26,251 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2021-10-21 19:39:26,252 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-10-21 19:39:27,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-21 19:39:27,310 INFO L93 Difference]: Finished difference Result 544 states and 676 transitions. [2021-10-21 19:39:27,310 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-10-21 19:39:27,310 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-10-21 19:39:27,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-21 19:39:27,313 INFO L225 Difference]: With dead ends: 544 [2021-10-21 19:39:27,313 INFO L226 Difference]: Without dead ends: 544 [2021-10-21 19:39:27,313 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 172.4ms TimeCoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2021-10-21 19:39:27,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 544 states. [2021-10-21 19:39:27,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 544 to 506. [2021-10-21 19:39:27,325 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-10-21 19:39:27,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 506 states to 506 states and 627 transitions. [2021-10-21 19:39:27,327 INFO L78 Accepts]: Start accepts. Automaton has 506 states and 627 transitions. Word has length 61 [2021-10-21 19:39:27,327 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-21 19:39:27,327 INFO L470 AbstractCegarLoop]: Abstraction has 506 states and 627 transitions. [2021-10-21 19:39:27,328 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-10-21 19:39:27,328 INFO L276 IsEmpty]: Start isEmpty. Operand 506 states and 627 transitions. [2021-10-21 19:39:27,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2021-10-21 19:39:27,329 INFO L504 BasicCegarLoop]: Found error trace [2021-10-21 19:39:27,329 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-21 19:39:27,329 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2021-10-21 19:39:27,330 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2021-10-21 19:39:27,330 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-21 19:39:27,330 INFO L82 PathProgramCache]: Analyzing trace with hash 456516591, now seen corresponding path program 1 times [2021-10-21 19:39:27,330 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-21 19:39:27,330 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [398758825] [2021-10-21 19:39:27,331 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-21 19:39:27,331 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-21 19:39:27,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:39:27,461 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-10-21 19:39:27,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:39:27,493 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-10-21 19:39:27,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:39:27,513 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-10-21 19:39:27,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:39:27,556 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-10-21 19:39:27,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:39:27,596 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-10-21 19:39:27,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:39:27,631 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-21 19:39:27,631 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-21 19:39:27,631 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [398758825] [2021-10-21 19:39:27,631 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [398758825] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-21 19:39:27,631 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-21 19:39:27,631 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2021-10-21 19:39:27,632 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [364545202] [2021-10-21 19:39:27,632 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-10-21 19:39:27,633 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-21 19:39:27,634 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-10-21 19:39:27,634 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2021-10-21 19:39:27,634 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-10-21 19:39:28,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-21 19:39:28,774 INFO L93 Difference]: Finished difference Result 568 states and 708 transitions. [2021-10-21 19:39:28,774 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-10-21 19:39:28,774 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-10-21 19:39:28,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-21 19:39:28,777 INFO L225 Difference]: With dead ends: 568 [2021-10-21 19:39:28,777 INFO L226 Difference]: Without dead ends: 567 [2021-10-21 19:39:28,778 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 295.8ms TimeCoverageRelationStatistics Valid=48, Invalid=192, Unknown=0, NotChecked=0, Total=240 [2021-10-21 19:39:28,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 567 states. [2021-10-21 19:39:28,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 567 to 523. [2021-10-21 19:39:28,790 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-10-21 19:39:28,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 523 states to 523 states and 649 transitions. [2021-10-21 19:39:28,791 INFO L78 Accepts]: Start accepts. Automaton has 523 states and 649 transitions. Word has length 55 [2021-10-21 19:39:28,791 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-21 19:39:28,792 INFO L470 AbstractCegarLoop]: Abstraction has 523 states and 649 transitions. [2021-10-21 19:39:28,792 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-10-21 19:39:28,792 INFO L276 IsEmpty]: Start isEmpty. Operand 523 states and 649 transitions. [2021-10-21 19:39:28,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2021-10-21 19:39:28,793 INFO L504 BasicCegarLoop]: Found error trace [2021-10-21 19:39:28,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-10-21 19:39:28,794 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2021-10-21 19:39:28,794 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2021-10-21 19:39:28,794 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-21 19:39:28,794 INFO L82 PathProgramCache]: Analyzing trace with hash 456793421, now seen corresponding path program 1 times [2021-10-21 19:39:28,795 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-21 19:39:28,795 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1843206668] [2021-10-21 19:39:28,795 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-21 19:39:28,795 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-21 19:39:28,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:39:28,931 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-10-21 19:39:28,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:39:28,966 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-10-21 19:39:28,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:39:28,985 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-10-21 19:39:28,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:39:29,008 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-10-21 19:39:29,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:39:29,049 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-10-21 19:39:29,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:39:29,076 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-21 19:39:29,077 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-21 19:39:29,077 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1843206668] [2021-10-21 19:39:29,077 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1843206668] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-21 19:39:29,077 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-21 19:39:29,077 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2021-10-21 19:39:29,077 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [965108557] [2021-10-21 19:39:29,078 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-10-21 19:39:29,078 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-21 19:39:29,078 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-10-21 19:39:29,079 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2021-10-21 19:39:29,079 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-10-21 19:39:30,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-21 19:39:30,078 INFO L93 Difference]: Finished difference Result 563 states and 696 transitions. [2021-10-21 19:39:30,080 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-10-21 19:39:30,081 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-10-21 19:39:30,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-21 19:39:30,084 INFO L225 Difference]: With dead ends: 563 [2021-10-21 19:39:30,084 INFO L226 Difference]: Without dead ends: 551 [2021-10-21 19:39:30,085 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 203.7ms TimeCoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2021-10-21 19:39:30,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 551 states. [2021-10-21 19:39:30,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 551 to 520. [2021-10-21 19:39:30,108 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-10-21 19:39:30,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 520 states to 520 states and 645 transitions. [2021-10-21 19:39:30,109 INFO L78 Accepts]: Start accepts. Automaton has 520 states and 645 transitions. Word has length 55 [2021-10-21 19:39:30,110 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-21 19:39:30,110 INFO L470 AbstractCegarLoop]: Abstraction has 520 states and 645 transitions. [2021-10-21 19:39:30,110 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-10-21 19:39:30,110 INFO L276 IsEmpty]: Start isEmpty. Operand 520 states and 645 transitions. [2021-10-21 19:39:30,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2021-10-21 19:39:30,113 INFO L504 BasicCegarLoop]: Found error trace [2021-10-21 19:39:30,113 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-21 19:39:30,113 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2021-10-21 19:39:30,113 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2021-10-21 19:39:30,114 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-21 19:39:30,114 INFO L82 PathProgramCache]: Analyzing trace with hash 1713148089, now seen corresponding path program 1 times [2021-10-21 19:39:30,114 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-21 19:39:30,114 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1398323706] [2021-10-21 19:39:30,114 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-21 19:39:30,115 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-21 19:39:30,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:39:30,236 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-10-21 19:39:30,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:39:30,268 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-10-21 19:39:30,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:39:30,286 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-10-21 19:39:30,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:39:30,306 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-10-21 19:39:30,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:39:30,344 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2021-10-21 19:39:30,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:39:30,358 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2021-10-21 19:39:30,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:39:30,362 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-21 19:39:30,363 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-21 19:39:30,363 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1398323706] [2021-10-21 19:39:30,363 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1398323706] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-21 19:39:30,363 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-21 19:39:30,363 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-10-21 19:39:30,363 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [857052512] [2021-10-21 19:39:30,364 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-10-21 19:39:30,364 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-21 19:39:30,364 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-10-21 19:39:30,365 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2021-10-21 19:39:30,365 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-10-21 19:39:31,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-21 19:39:31,671 INFO L93 Difference]: Finished difference Result 563 states and 695 transitions. [2021-10-21 19:39:31,671 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-10-21 19:39:31,671 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-10-21 19:39:31,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-21 19:39:31,673 INFO L225 Difference]: With dead ends: 563 [2021-10-21 19:39:31,673 INFO L226 Difference]: Without dead ends: 523 [2021-10-21 19:39:31,674 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 225.1ms TimeCoverageRelationStatistics Valid=53, Invalid=187, Unknown=0, NotChecked=0, Total=240 [2021-10-21 19:39:31,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 523 states. [2021-10-21 19:39:31,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 523 to 496. [2021-10-21 19:39:31,685 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-10-21 19:39:31,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 496 states to 496 states and 615 transitions. [2021-10-21 19:39:31,687 INFO L78 Accepts]: Start accepts. Automaton has 496 states and 615 transitions. Word has length 57 [2021-10-21 19:39:31,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-21 19:39:31,687 INFO L470 AbstractCegarLoop]: Abstraction has 496 states and 615 transitions. [2021-10-21 19:39:31,688 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-10-21 19:39:31,688 INFO L276 IsEmpty]: Start isEmpty. Operand 496 states and 615 transitions. [2021-10-21 19:39:31,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2021-10-21 19:39:31,689 INFO L504 BasicCegarLoop]: Found error trace [2021-10-21 19:39:31,689 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-10-21 19:39:31,689 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2021-10-21 19:39:31,690 INFO L402 AbstractCegarLoop]: === Iteration 24 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2021-10-21 19:39:31,690 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-21 19:39:31,690 INFO L82 PathProgramCache]: Analyzing trace with hash 471512753, now seen corresponding path program 1 times [2021-10-21 19:39:31,690 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-21 19:39:31,690 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [895498914] [2021-10-21 19:39:31,691 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-21 19:39:31,691 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-21 19:39:31,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:39:31,814 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-10-21 19:39:31,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:39:31,844 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-10-21 19:39:31,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:39:31,864 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-10-21 19:39:31,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:39:31,885 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-10-21 19:39:31,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:39:31,916 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-10-21 19:39:31,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:39:31,923 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-21 19:39:31,923 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-21 19:39:31,923 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [895498914] [2021-10-21 19:39:31,924 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [895498914] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-21 19:39:31,924 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-21 19:39:31,924 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-10-21 19:39:31,924 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2020144036] [2021-10-21 19:39:31,924 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-10-21 19:39:31,925 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-21 19:39:31,925 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-10-21 19:39:31,925 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2021-10-21 19:39:31,925 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-10-21 19:39:33,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-21 19:39:33,100 INFO L93 Difference]: Finished difference Result 527 states and 650 transitions. [2021-10-21 19:39:33,100 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-10-21 19:39:33,100 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-10-21 19:39:33,100 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-21 19:39:33,103 INFO L225 Difference]: With dead ends: 527 [2021-10-21 19:39:33,103 INFO L226 Difference]: Without dead ends: 513 [2021-10-21 19:39:33,103 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 575.6ms TimeCoverageRelationStatistics Valid=81, Invalid=191, Unknown=0, NotChecked=0, Total=272 [2021-10-21 19:39:33,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 513 states. [2021-10-21 19:39:33,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 513 to 478. [2021-10-21 19:39:33,114 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-10-21 19:39:33,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 478 states to 478 states and 590 transitions. [2021-10-21 19:39:33,116 INFO L78 Accepts]: Start accepts. Automaton has 478 states and 590 transitions. Word has length 56 [2021-10-21 19:39:33,116 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-21 19:39:33,116 INFO L470 AbstractCegarLoop]: Abstraction has 478 states and 590 transitions. [2021-10-21 19:39:33,116 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-10-21 19:39:33,117 INFO L276 IsEmpty]: Start isEmpty. Operand 478 states and 590 transitions. [2021-10-21 19:39:33,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2021-10-21 19:39:33,118 INFO L504 BasicCegarLoop]: Found error trace [2021-10-21 19:39:33,118 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-10-21 19:39:33,118 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2021-10-21 19:39:33,118 INFO L402 AbstractCegarLoop]: === Iteration 25 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2021-10-21 19:39:33,119 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-21 19:39:33,119 INFO L82 PathProgramCache]: Analyzing trace with hash -70909626, now seen corresponding path program 1 times [2021-10-21 19:39:33,119 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-21 19:39:33,119 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [354722900] [2021-10-21 19:39:33,119 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-21 19:39:33,120 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-21 19:39:33,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:39:33,234 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-10-21 19:39:33,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:39:33,268 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-10-21 19:39:33,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:39:33,288 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-10-21 19:39:33,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:39:33,300 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2021-10-21 19:39:33,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:39:33,339 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-10-21 19:39:33,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:39:33,342 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-10-21 19:39:33,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:39:33,353 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-10-21 19:39:33,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:39:33,365 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-21 19:39:33,365 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-21 19:39:33,365 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [354722900] [2021-10-21 19:39:33,365 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [354722900] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-21 19:39:33,365 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-21 19:39:33,366 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-10-21 19:39:33,366 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [639102529] [2021-10-21 19:39:33,366 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-10-21 19:39:33,366 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-21 19:39:33,367 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-10-21 19:39:33,367 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2021-10-21 19:39:33,367 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-10-21 19:39:34,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-21 19:39:34,844 INFO L93 Difference]: Finished difference Result 511 states and 631 transitions. [2021-10-21 19:39:34,845 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-10-21 19:39:34,845 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-10-21 19:39:34,845 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-21 19:39:34,848 INFO L225 Difference]: With dead ends: 511 [2021-10-21 19:39:34,848 INFO L226 Difference]: Without dead ends: 511 [2021-10-21 19:39:34,848 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 442.9ms TimeCoverageRelationStatistics Valid=106, Invalid=314, Unknown=0, NotChecked=0, Total=420 [2021-10-21 19:39:34,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 511 states. [2021-10-21 19:39:34,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 511 to 478. [2021-10-21 19:39:34,859 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-10-21 19:39:34,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 478 states to 478 states and 588 transitions. [2021-10-21 19:39:34,861 INFO L78 Accepts]: Start accepts. Automaton has 478 states and 588 transitions. Word has length 65 [2021-10-21 19:39:34,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-21 19:39:34,861 INFO L470 AbstractCegarLoop]: Abstraction has 478 states and 588 transitions. [2021-10-21 19:39:34,862 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-10-21 19:39:34,862 INFO L276 IsEmpty]: Start isEmpty. Operand 478 states and 588 transitions. [2021-10-21 19:39:34,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2021-10-21 19:39:34,863 INFO L504 BasicCegarLoop]: Found error trace [2021-10-21 19:39:34,863 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-21 19:39:34,863 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2021-10-21 19:39:34,864 INFO L402 AbstractCegarLoop]: === Iteration 26 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2021-10-21 19:39:34,864 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-21 19:39:34,864 INFO L82 PathProgramCache]: Analyzing trace with hash -876554703, now seen corresponding path program 1 times [2021-10-21 19:39:34,864 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-21 19:39:34,864 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [774938576] [2021-10-21 19:39:34,864 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-21 19:39:34,865 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-21 19:39:34,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:39:34,983 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-10-21 19:39:34,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:39:35,014 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-10-21 19:39:35,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:39:35,031 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-10-21 19:39:35,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:39:35,051 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-10-21 19:39:35,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:39:35,098 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-10-21 19:39:35,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:39:35,123 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-21 19:39:35,123 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-21 19:39:35,123 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [774938576] [2021-10-21 19:39:35,124 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [774938576] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-21 19:39:35,124 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-21 19:39:35,124 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2021-10-21 19:39:35,124 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1418322075] [2021-10-21 19:39:35,125 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2021-10-21 19:39:35,125 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-21 19:39:35,126 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-10-21 19:39:35,126 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=148, Unknown=0, NotChecked=0, Total=182 [2021-10-21 19:39:35,127 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-10-21 19:39:36,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-21 19:39:36,167 INFO L93 Difference]: Finished difference Result 519 states and 636 transitions. [2021-10-21 19:39:36,167 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-10-21 19:39:36,167 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-10-21 19:39:36,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-21 19:39:36,170 INFO L225 Difference]: With dead ends: 519 [2021-10-21 19:39:36,170 INFO L226 Difference]: Without dead ends: 501 [2021-10-21 19:39:36,171 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 202.1ms TimeCoverageRelationStatistics Valid=42, Invalid=198, Unknown=0, NotChecked=0, Total=240 [2021-10-21 19:39:36,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 501 states. [2021-10-21 19:39:36,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 501 to 474. [2021-10-21 19:39:36,181 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-10-21 19:39:36,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 474 states to 474 states and 582 transitions. [2021-10-21 19:39:36,182 INFO L78 Accepts]: Start accepts. Automaton has 474 states and 582 transitions. Word has length 60 [2021-10-21 19:39:36,182 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-21 19:39:36,182 INFO L470 AbstractCegarLoop]: Abstraction has 474 states and 582 transitions. [2021-10-21 19:39:36,182 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-10-21 19:39:36,183 INFO L276 IsEmpty]: Start isEmpty. Operand 474 states and 582 transitions. [2021-10-21 19:39:36,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2021-10-21 19:39:36,184 INFO L504 BasicCegarLoop]: Found error trace [2021-10-21 19:39:36,184 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-21 19:39:36,184 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2021-10-21 19:39:36,184 INFO L402 AbstractCegarLoop]: === Iteration 27 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2021-10-21 19:39:36,185 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-21 19:39:36,185 INFO L82 PathProgramCache]: Analyzing trace with hash -863080833, now seen corresponding path program 1 times [2021-10-21 19:39:36,185 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-21 19:39:36,185 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1046063536] [2021-10-21 19:39:36,185 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-21 19:39:36,186 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-21 19:39:36,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:39:36,328 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-10-21 19:39:36,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:39:36,360 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-10-21 19:39:36,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:39:36,378 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-10-21 19:39:36,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:39:36,393 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2021-10-21 19:39:36,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:39:36,440 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-10-21 19:39:36,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:39:36,443 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-10-21 19:39:36,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:39:36,456 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-10-21 19:39:36,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:39:36,459 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-21 19:39:36,459 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-21 19:39:36,460 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1046063536] [2021-10-21 19:39:36,460 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1046063536] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-21 19:39:36,460 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-21 19:39:36,460 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-10-21 19:39:36,460 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1054052828] [2021-10-21 19:39:36,461 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-10-21 19:39:36,461 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-21 19:39:36,461 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-10-21 19:39:36,461 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2021-10-21 19:39:36,462 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-10-21 19:39:37,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-21 19:39:37,428 INFO L93 Difference]: Finished difference Result 526 states and 647 transitions. [2021-10-21 19:39:37,428 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-10-21 19:39:37,428 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-10-21 19:39:37,429 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-21 19:39:37,430 INFO L225 Difference]: With dead ends: 526 [2021-10-21 19:39:37,430 INFO L226 Difference]: Without dead ends: 526 [2021-10-21 19:39:37,431 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 284.5ms TimeCoverageRelationStatistics Valid=60, Invalid=180, Unknown=0, NotChecked=0, Total=240 [2021-10-21 19:39:37,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 526 states. [2021-10-21 19:39:37,439 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 526 to 474. [2021-10-21 19:39:37,440 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-10-21 19:39:37,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 474 states to 474 states and 580 transitions. [2021-10-21 19:39:37,441 INFO L78 Accepts]: Start accepts. Automaton has 474 states and 580 transitions. Word has length 68 [2021-10-21 19:39:37,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-21 19:39:37,442 INFO L470 AbstractCegarLoop]: Abstraction has 474 states and 580 transitions. [2021-10-21 19:39:37,442 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-10-21 19:39:37,442 INFO L276 IsEmpty]: Start isEmpty. Operand 474 states and 580 transitions. [2021-10-21 19:39:37,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2021-10-21 19:39:37,443 INFO L504 BasicCegarLoop]: Found error trace [2021-10-21 19:39:37,444 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-10-21 19:39:37,444 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2021-10-21 19:39:37,444 INFO L402 AbstractCegarLoop]: === Iteration 28 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2021-10-21 19:39:37,444 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-21 19:39:37,444 INFO L82 PathProgramCache]: Analyzing trace with hash -1815591607, now seen corresponding path program 1 times [2021-10-21 19:39:37,445 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-21 19:39:37,445 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1051050019] [2021-10-21 19:39:37,445 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-21 19:39:37,445 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-21 19:39:37,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:39:37,556 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-10-21 19:39:37,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:39:37,585 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-10-21 19:39:37,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:39:37,602 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-10-21 19:39:37,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:39:37,625 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-10-21 19:39:37,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:39:37,669 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-10-21 19:39:37,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:39:37,693 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-21 19:39:37,693 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-21 19:39:37,693 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1051050019] [2021-10-21 19:39:37,693 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1051050019] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-21 19:39:37,693 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-21 19:39:37,693 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2021-10-21 19:39:37,694 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1307573103] [2021-10-21 19:39:37,695 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2021-10-21 19:39:37,695 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-21 19:39:37,695 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-10-21 19:39:37,696 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=148, Unknown=0, NotChecked=0, Total=182 [2021-10-21 19:39:37,696 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-10-21 19:39:38,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-21 19:39:38,719 INFO L93 Difference]: Finished difference Result 515 states and 628 transitions. [2021-10-21 19:39:38,720 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-10-21 19:39:38,720 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-10-21 19:39:38,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-21 19:39:38,722 INFO L225 Difference]: With dead ends: 515 [2021-10-21 19:39:38,722 INFO L226 Difference]: Without dead ends: 496 [2021-10-21 19:39:38,722 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 208.7ms TimeCoverageRelationStatistics Valid=42, Invalid=198, Unknown=0, NotChecked=0, Total=240 [2021-10-21 19:39:38,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 496 states. [2021-10-21 19:39:38,730 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 496 to 469. [2021-10-21 19:39:38,731 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-10-21 19:39:38,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 469 states to 469 states and 573 transitions. [2021-10-21 19:39:38,732 INFO L78 Accepts]: Start accepts. Automaton has 469 states and 573 transitions. Word has length 61 [2021-10-21 19:39:38,733 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-21 19:39:38,733 INFO L470 AbstractCegarLoop]: Abstraction has 469 states and 573 transitions. [2021-10-21 19:39:38,733 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-10-21 19:39:38,733 INFO L276 IsEmpty]: Start isEmpty. Operand 469 states and 573 transitions. [2021-10-21 19:39:38,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2021-10-21 19:39:38,734 INFO L504 BasicCegarLoop]: Found error trace [2021-10-21 19:39:38,735 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-21 19:39:38,735 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2021-10-21 19:39:38,735 INFO L402 AbstractCegarLoop]: === Iteration 29 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2021-10-21 19:39:38,735 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-21 19:39:38,736 INFO L82 PathProgramCache]: Analyzing trace with hash 1549264219, now seen corresponding path program 1 times [2021-10-21 19:39:38,736 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-21 19:39:38,736 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2091367108] [2021-10-21 19:39:38,736 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-21 19:39:38,736 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-21 19:39:38,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:39:38,843 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-10-21 19:39:38,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:39:38,873 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-10-21 19:39:38,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:39:38,889 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-10-21 19:39:38,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:39:38,909 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-10-21 19:39:38,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:39:38,955 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-10-21 19:39:38,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:39:38,989 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-21 19:39:38,989 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-21 19:39:38,989 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2091367108] [2021-10-21 19:39:38,989 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2091367108] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-21 19:39:38,990 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-21 19:39:38,990 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2021-10-21 19:39:38,990 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [73912068] [2021-10-21 19:39:38,990 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2021-10-21 19:39:38,990 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-21 19:39:38,991 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-10-21 19:39:38,992 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=148, Unknown=0, NotChecked=0, Total=182 [2021-10-21 19:39:38,992 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-10-21 19:39:39,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-21 19:39:39,899 INFO L93 Difference]: Finished difference Result 510 states and 621 transitions. [2021-10-21 19:39:39,900 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-10-21 19:39:39,900 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-10-21 19:39:39,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-21 19:39:39,902 INFO L225 Difference]: With dead ends: 510 [2021-10-21 19:39:39,902 INFO L226 Difference]: Without dead ends: 492 [2021-10-21 19:39:39,903 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 191.8ms TimeCoverageRelationStatistics Valid=42, Invalid=198, Unknown=0, NotChecked=0, Total=240 [2021-10-21 19:39:39,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 492 states. [2021-10-21 19:39:39,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 492 to 465. [2021-10-21 19:39:39,912 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-10-21 19:39:39,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 465 states to 465 states and 567 transitions. [2021-10-21 19:39:39,913 INFO L78 Accepts]: Start accepts. Automaton has 465 states and 567 transitions. Word has length 61 [2021-10-21 19:39:39,913 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-21 19:39:39,913 INFO L470 AbstractCegarLoop]: Abstraction has 465 states and 567 transitions. [2021-10-21 19:39:39,914 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-10-21 19:39:39,914 INFO L276 IsEmpty]: Start isEmpty. Operand 465 states and 567 transitions. [2021-10-21 19:39:39,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2021-10-21 19:39:39,915 INFO L504 BasicCegarLoop]: Found error trace [2021-10-21 19:39:39,915 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-21 19:39:39,915 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2021-10-21 19:39:39,916 INFO L402 AbstractCegarLoop]: === Iteration 30 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2021-10-21 19:39:39,916 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-21 19:39:39,916 INFO L82 PathProgramCache]: Analyzing trace with hash -1654833550, now seen corresponding path program 1 times [2021-10-21 19:39:39,916 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-21 19:39:39,916 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [428057839] [2021-10-21 19:39:39,917 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-21 19:39:39,917 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-21 19:39:39,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:39:40,029 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-10-21 19:39:40,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:39:40,059 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-10-21 19:39:40,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:39:40,075 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-10-21 19:39:40,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:39:40,089 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2021-10-21 19:39:40,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:39:40,126 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-10-21 19:39:40,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:39:40,131 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-10-21 19:39:40,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:39:40,142 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-10-21 19:39:40,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:39:40,145 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-21 19:39:40,145 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-21 19:39:40,145 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [428057839] [2021-10-21 19:39:40,145 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [428057839] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-21 19:39:40,146 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-21 19:39:40,146 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-10-21 19:39:40,146 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1286162612] [2021-10-21 19:39:40,146 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-10-21 19:39:40,146 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-21 19:39:40,147 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-10-21 19:39:40,147 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2021-10-21 19:39:40,147 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-10-21 19:39:40,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-21 19:39:40,920 INFO L93 Difference]: Finished difference Result 636 states and 773 transitions. [2021-10-21 19:39:40,920 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-10-21 19:39:40,920 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-10-21 19:39:40,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-21 19:39:40,922 INFO L225 Difference]: With dead ends: 636 [2021-10-21 19:39:40,922 INFO L226 Difference]: Without dead ends: 636 [2021-10-21 19:39:40,923 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 221.8ms TimeCoverageRelationStatistics Valid=57, Invalid=99, Unknown=0, NotChecked=0, Total=156 [2021-10-21 19:39:40,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 636 states. [2021-10-21 19:39:40,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 636 to 586. [2021-10-21 19:39:40,934 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-10-21 19:39:40,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 586 states to 586 states and 715 transitions. [2021-10-21 19:39:40,936 INFO L78 Accepts]: Start accepts. Automaton has 586 states and 715 transitions. Word has length 67 [2021-10-21 19:39:40,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-21 19:39:40,936 INFO L470 AbstractCegarLoop]: Abstraction has 586 states and 715 transitions. [2021-10-21 19:39:40,937 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-10-21 19:39:40,937 INFO L276 IsEmpty]: Start isEmpty. Operand 586 states and 715 transitions. [2021-10-21 19:39:40,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2021-10-21 19:39:40,938 INFO L504 BasicCegarLoop]: Found error trace [2021-10-21 19:39:40,938 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-10-21 19:39:40,939 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2021-10-21 19:39:40,939 INFO L402 AbstractCegarLoop]: === Iteration 31 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2021-10-21 19:39:40,939 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-21 19:39:40,939 INFO L82 PathProgramCache]: Analyzing trace with hash 2014934282, now seen corresponding path program 1 times [2021-10-21 19:39:40,939 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-21 19:39:40,940 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1927566225] [2021-10-21 19:39:40,940 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-21 19:39:40,940 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-21 19:39:40,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:39:41,045 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-10-21 19:39:41,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:39:41,083 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-10-21 19:39:41,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:39:41,110 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-10-21 19:39:41,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:39:41,131 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-10-21 19:39:41,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:39:41,184 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2021-10-21 19:39:41,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:39:41,217 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-21 19:39:41,218 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-21 19:39:41,218 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1927566225] [2021-10-21 19:39:41,218 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1927566225] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-21 19:39:41,218 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-21 19:39:41,218 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2021-10-21 19:39:41,218 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1659700210] [2021-10-21 19:39:41,219 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2021-10-21 19:39:41,219 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-21 19:39:41,219 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-10-21 19:39:41,220 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=148, Unknown=0, NotChecked=0, Total=182 [2021-10-21 19:39:41,220 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-10-21 19:39:42,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-21 19:39:42,431 INFO L93 Difference]: Finished difference Result 627 states and 764 transitions. [2021-10-21 19:39:42,431 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-10-21 19:39:42,431 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-10-21 19:39:42,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-21 19:39:42,434 INFO L225 Difference]: With dead ends: 627 [2021-10-21 19:39:42,434 INFO L226 Difference]: Without dead ends: 587 [2021-10-21 19:39:42,435 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 206.8ms TimeCoverageRelationStatistics Valid=42, Invalid=198, Unknown=0, NotChecked=0, Total=240 [2021-10-21 19:39:42,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 587 states. [2021-10-21 19:39:42,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 587 to 560. [2021-10-21 19:39:42,446 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-10-21 19:39:42,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 560 states to 560 states and 683 transitions. [2021-10-21 19:39:42,447 INFO L78 Accepts]: Start accepts. Automaton has 560 states and 683 transitions. Word has length 65 [2021-10-21 19:39:42,447 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-21 19:39:42,447 INFO L470 AbstractCegarLoop]: Abstraction has 560 states and 683 transitions. [2021-10-21 19:39:42,448 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-10-21 19:39:42,448 INFO L276 IsEmpty]: Start isEmpty. Operand 560 states and 683 transitions. [2021-10-21 19:39:42,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2021-10-21 19:39:42,449 INFO L504 BasicCegarLoop]: Found error trace [2021-10-21 19:39:42,449 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-21 19:39:42,450 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2021-10-21 19:39:42,450 INFO L402 AbstractCegarLoop]: === Iteration 32 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2021-10-21 19:39:42,450 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-21 19:39:42,450 INFO L82 PathProgramCache]: Analyzing trace with hash 1554016619, now seen corresponding path program 1 times [2021-10-21 19:39:42,450 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-21 19:39:42,451 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [667965747] [2021-10-21 19:39:42,451 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-21 19:39:42,451 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-21 19:39:42,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:39:42,586 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-10-21 19:39:42,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:39:42,624 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-10-21 19:39:42,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:39:42,648 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-10-21 19:39:42,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:39:42,661 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2021-10-21 19:39:42,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:39:42,677 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-10-21 19:39:42,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:39:42,681 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-10-21 19:39:42,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:39:42,691 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-10-21 19:39:42,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:39:42,704 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2021-10-21 19:39:42,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:39:42,718 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-21 19:39:42,718 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-21 19:39:42,718 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [667965747] [2021-10-21 19:39:42,718 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [667965747] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-21 19:39:42,719 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-21 19:39:42,719 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-10-21 19:39:42,719 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1438070754] [2021-10-21 19:39:42,719 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-10-21 19:39:42,719 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-21 19:39:42,720 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-10-21 19:39:42,720 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2021-10-21 19:39:42,720 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-10-21 19:39:44,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-21 19:39:44,234 INFO L93 Difference]: Finished difference Result 575 states and 695 transitions. [2021-10-21 19:39:44,234 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2021-10-21 19:39:44,235 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-10-21 19:39:44,235 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-21 19:39:44,238 INFO L225 Difference]: With dead ends: 575 [2021-10-21 19:39:44,238 INFO L226 Difference]: Without dead ends: 575 [2021-10-21 19:39:44,238 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 107 ImplicationChecksByTransitivity, 645.2ms TimeCoverageRelationStatistics Valid=204, Invalid=498, Unknown=0, NotChecked=0, Total=702 [2021-10-21 19:39:44,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 575 states. [2021-10-21 19:39:44,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 575 to 542. [2021-10-21 19:39:44,249 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-10-21 19:39:44,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 542 states to 542 states and 653 transitions. [2021-10-21 19:39:44,251 INFO L78 Accepts]: Start accepts. Automaton has 542 states and 653 transitions. Word has length 79 [2021-10-21 19:39:44,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-21 19:39:44,251 INFO L470 AbstractCegarLoop]: Abstraction has 542 states and 653 transitions. [2021-10-21 19:39:44,251 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-10-21 19:39:44,252 INFO L276 IsEmpty]: Start isEmpty. Operand 542 states and 653 transitions. [2021-10-21 19:39:44,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2021-10-21 19:39:44,253 INFO L504 BasicCegarLoop]: Found error trace [2021-10-21 19:39:44,253 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-10-21 19:39:44,253 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2021-10-21 19:39:44,254 INFO L402 AbstractCegarLoop]: === Iteration 33 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2021-10-21 19:39:44,254 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-21 19:39:44,254 INFO L82 PathProgramCache]: Analyzing trace with hash -478221177, now seen corresponding path program 1 times [2021-10-21 19:39:44,254 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-21 19:39:44,255 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [703951259] [2021-10-21 19:39:44,255 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-21 19:39:44,255 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-21 19:39:44,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:39:44,399 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-10-21 19:39:44,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:39:44,432 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-10-21 19:39:44,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:39:44,452 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-10-21 19:39:44,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:39:44,465 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2021-10-21 19:39:44,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:39:44,507 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-10-21 19:39:44,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:39:44,510 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-10-21 19:39:44,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:39:44,522 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-10-21 19:39:44,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:39:44,538 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2021-10-21 19:39:44,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:39:44,554 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-10-21 19:39:44,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:39:44,557 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-21 19:39:44,558 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-21 19:39:44,558 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [703951259] [2021-10-21 19:39:44,558 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [703951259] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-21 19:39:44,558 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-21 19:39:44,558 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2021-10-21 19:39:44,559 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1691606865] [2021-10-21 19:39:44,559 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2021-10-21 19:39:44,559 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-21 19:39:44,559 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-10-21 19:39:44,560 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=133, Unknown=0, NotChecked=0, Total=182 [2021-10-21 19:39:44,560 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-10-21 19:39:45,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-21 19:39:45,598 INFO L93 Difference]: Finished difference Result 651 states and 821 transitions. [2021-10-21 19:39:45,598 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2021-10-21 19:39:45,598 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-10-21 19:39:45,598 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-21 19:39:45,600 INFO L225 Difference]: With dead ends: 651 [2021-10-21 19:39:45,600 INFO L226 Difference]: Without dead ends: 651 [2021-10-21 19:39:45,602 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 368.5ms TimeCoverageRelationStatistics Valid=115, Invalid=391, Unknown=0, NotChecked=0, Total=506 [2021-10-21 19:39:45,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 651 states. [2021-10-21 19:39:45,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 651 to 506. [2021-10-21 19:39:45,613 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-10-21 19:39:45,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 506 states to 506 states and 607 transitions. [2021-10-21 19:39:45,614 INFO L78 Accepts]: Start accepts. Automaton has 506 states and 607 transitions. Word has length 80 [2021-10-21 19:39:45,614 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-21 19:39:45,615 INFO L470 AbstractCegarLoop]: Abstraction has 506 states and 607 transitions. [2021-10-21 19:39:45,615 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-10-21 19:39:45,615 INFO L276 IsEmpty]: Start isEmpty. Operand 506 states and 607 transitions. [2021-10-21 19:39:45,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2021-10-21 19:39:45,616 INFO L504 BasicCegarLoop]: Found error trace [2021-10-21 19:39:45,617 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-10-21 19:39:45,617 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2021-10-21 19:39:45,617 INFO L402 AbstractCegarLoop]: === Iteration 34 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2021-10-21 19:39:45,617 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-21 19:39:45,618 INFO L82 PathProgramCache]: Analyzing trace with hash -998039197, now seen corresponding path program 1 times [2021-10-21 19:39:45,618 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-21 19:39:45,618 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1980251811] [2021-10-21 19:39:45,618 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-21 19:39:45,618 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-21 19:39:45,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:39:45,731 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-10-21 19:39:45,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:39:45,768 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-10-21 19:39:45,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:39:45,786 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-10-21 19:39:45,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:39:45,806 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-10-21 19:39:45,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:39:45,857 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-10-21 19:39:45,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:39:45,905 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-10-21 19:39:45,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:39:45,908 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-10-21 19:39:45,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:39:45,921 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-10-21 19:39:45,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:39:45,924 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2021-10-21 19:39:45,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:39:45,926 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-21 19:39:45,927 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-21 19:39:45,927 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1980251811] [2021-10-21 19:39:45,927 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1980251811] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-21 19:39:45,927 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-21 19:39:45,927 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2021-10-21 19:39:45,928 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1495188537] [2021-10-21 19:39:45,928 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2021-10-21 19:39:45,928 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-21 19:39:45,928 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-10-21 19:39:45,929 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=192, Unknown=0, NotChecked=0, Total=240 [2021-10-21 19:39:45,929 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-10-21 19:39:46,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-21 19:39:46,993 INFO L93 Difference]: Finished difference Result 581 states and 696 transitions. [2021-10-21 19:39:46,993 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2021-10-21 19:39:46,993 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-10-21 19:39:46,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-21 19:39:46,995 INFO L225 Difference]: With dead ends: 581 [2021-10-21 19:39:46,995 INFO L226 Difference]: Without dead ends: 563 [2021-10-21 19:39:46,995 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 378.1ms TimeCoverageRelationStatistics Valid=101, Invalid=499, Unknown=0, NotChecked=0, Total=600 [2021-10-21 19:39:46,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 563 states. [2021-10-21 19:39:47,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 563 to 514. [2021-10-21 19:39:47,004 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-10-21 19:39:47,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 514 states to 514 states and 617 transitions. [2021-10-21 19:39:47,005 INFO L78 Accepts]: Start accepts. Automaton has 514 states and 617 transitions. Word has length 85 [2021-10-21 19:39:47,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-21 19:39:47,005 INFO L470 AbstractCegarLoop]: Abstraction has 514 states and 617 transitions. [2021-10-21 19:39:47,005 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-10-21 19:39:47,006 INFO L276 IsEmpty]: Start isEmpty. Operand 514 states and 617 transitions. [2021-10-21 19:39:47,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2021-10-21 19:39:47,007 INFO L504 BasicCegarLoop]: Found error trace [2021-10-21 19:39:47,007 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-10-21 19:39:47,007 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2021-10-21 19:39:47,008 INFO L402 AbstractCegarLoop]: === Iteration 35 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2021-10-21 19:39:47,008 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-21 19:39:47,008 INFO L82 PathProgramCache]: Analyzing trace with hash 2056891224, now seen corresponding path program 1 times [2021-10-21 19:39:47,008 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-21 19:39:47,008 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1851775004] [2021-10-21 19:39:47,009 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-21 19:39:47,009 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-21 19:39:47,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:39:47,115 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-10-21 19:39:47,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:39:47,148 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-10-21 19:39:47,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:39:47,165 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-10-21 19:39:47,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:39:47,187 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-10-21 19:39:47,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:39:47,226 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2021-10-21 19:39:47,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:39:47,244 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-10-21 19:39:47,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:39:47,271 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2021-10-21 19:39:47,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:39:47,276 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-21 19:39:47,276 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-21 19:39:47,276 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1851775004] [2021-10-21 19:39:47,277 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1851775004] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-21 19:39:47,277 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-21 19:39:47,277 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-10-21 19:39:47,277 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [763340788] [2021-10-21 19:39:47,278 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-10-21 19:39:47,278 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-21 19:39:47,278 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-10-21 19:39:47,278 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2021-10-21 19:39:47,279 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-10-21 19:39:48,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-21 19:39:48,459 INFO L93 Difference]: Finished difference Result 667 states and 781 transitions. [2021-10-21 19:39:48,459 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-10-21 19:39:48,460 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-10-21 19:39:48,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-21 19:39:48,462 INFO L225 Difference]: With dead ends: 667 [2021-10-21 19:39:48,462 INFO L226 Difference]: Without dead ends: 667 [2021-10-21 19:39:48,462 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 384.8ms TimeCoverageRelationStatistics Valid=124, Invalid=338, Unknown=0, NotChecked=0, Total=462 [2021-10-21 19:39:48,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 667 states. [2021-10-21 19:39:48,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 667 to 635. [2021-10-21 19:39:48,472 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-10-21 19:39:48,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 635 states to 635 states and 749 transitions. [2021-10-21 19:39:48,474 INFO L78 Accepts]: Start accepts. Automaton has 635 states and 749 transitions. Word has length 80 [2021-10-21 19:39:48,474 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-21 19:39:48,474 INFO L470 AbstractCegarLoop]: Abstraction has 635 states and 749 transitions. [2021-10-21 19:39:48,474 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-10-21 19:39:48,475 INFO L276 IsEmpty]: Start isEmpty. Operand 635 states and 749 transitions. [2021-10-21 19:39:48,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2021-10-21 19:39:48,476 INFO L504 BasicCegarLoop]: Found error trace [2021-10-21 19:39:48,476 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-10-21 19:39:48,477 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2021-10-21 19:39:48,477 INFO L402 AbstractCegarLoop]: === Iteration 36 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2021-10-21 19:39:48,477 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-21 19:39:48,477 INFO L82 PathProgramCache]: Analyzing trace with hash -1814178751, now seen corresponding path program 1 times [2021-10-21 19:39:48,477 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-21 19:39:48,478 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1110297700] [2021-10-21 19:39:48,478 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-21 19:39:48,478 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-21 19:39:48,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:39:48,591 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-10-21 19:39:48,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:39:48,618 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-10-21 19:39:48,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:39:48,649 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-10-21 19:39:48,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:39:48,671 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-10-21 19:39:48,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:39:48,728 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-10-21 19:39:48,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:39:48,771 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-10-21 19:39:48,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:39:48,774 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-10-21 19:39:48,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:39:48,790 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-10-21 19:39:48,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:39:48,793 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2021-10-21 19:39:48,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:39:48,797 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-21 19:39:48,797 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-21 19:39:48,798 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1110297700] [2021-10-21 19:39:48,798 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1110297700] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-21 19:39:48,798 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-21 19:39:48,798 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2021-10-21 19:39:48,798 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1414769147] [2021-10-21 19:39:48,799 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2021-10-21 19:39:48,799 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-21 19:39:48,799 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-10-21 19:39:48,799 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=192, Unknown=0, NotChecked=0, Total=240 [2021-10-21 19:39:48,800 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-10-21 19:39:49,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-21 19:39:49,990 INFO L93 Difference]: Finished difference Result 682 states and 798 transitions. [2021-10-21 19:39:49,990 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-10-21 19:39:49,990 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-10-21 19:39:49,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-21 19:39:49,992 INFO L225 Difference]: With dead ends: 682 [2021-10-21 19:39:49,992 INFO L226 Difference]: Without dead ends: 664 [2021-10-21 19:39:49,993 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 308.3ms TimeCoverageRelationStatistics Valid=78, Invalid=342, Unknown=0, NotChecked=0, Total=420 [2021-10-21 19:39:49,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 664 states. [2021-10-21 19:39:50,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 664 to 627. [2021-10-21 19:39:50,011 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-10-21 19:39:50,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 627 states to 627 states and 739 transitions. [2021-10-21 19:39:50,013 INFO L78 Accepts]: Start accepts. Automaton has 627 states and 739 transitions. Word has length 86 [2021-10-21 19:39:50,013 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-21 19:39:50,013 INFO L470 AbstractCegarLoop]: Abstraction has 627 states and 739 transitions. [2021-10-21 19:39:50,013 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-10-21 19:39:50,013 INFO L276 IsEmpty]: Start isEmpty. Operand 627 states and 739 transitions. [2021-10-21 19:39:50,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2021-10-21 19:39:50,015 INFO L504 BasicCegarLoop]: Found error trace [2021-10-21 19:39:50,015 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-10-21 19:39:50,015 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2021-10-21 19:39:50,015 INFO L402 AbstractCegarLoop]: === Iteration 37 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2021-10-21 19:39:50,016 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-21 19:39:50,016 INFO L82 PathProgramCache]: Analyzing trace with hash -1760569352, now seen corresponding path program 1 times [2021-10-21 19:39:50,016 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-21 19:39:50,016 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1924979090] [2021-10-21 19:39:50,017 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-21 19:39:50,017 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-21 19:39:50,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:39:50,117 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-10-21 19:39:50,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:39:50,156 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-10-21 19:39:50,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:39:50,186 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-10-21 19:39:50,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:39:50,206 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-10-21 19:39:50,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:39:50,231 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2021-10-21 19:39:50,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:39:50,245 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-10-21 19:39:50,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:39:50,259 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2021-10-21 19:39:50,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:39:50,263 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-21 19:39:50,264 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-21 19:39:50,264 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1924979090] [2021-10-21 19:39:50,264 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1924979090] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-21 19:39:50,264 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-21 19:39:50,264 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-10-21 19:39:50,265 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [157049571] [2021-10-21 19:39:50,266 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-10-21 19:39:50,267 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-21 19:39:50,267 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-10-21 19:39:50,267 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2021-10-21 19:39:50,268 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-10-21 19:39:51,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-21 19:39:51,016 INFO L93 Difference]: Finished difference Result 634 states and 743 transitions. [2021-10-21 19:39:51,016 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-10-21 19:39:51,017 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-10-21 19:39:51,017 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-21 19:39:51,018 INFO L225 Difference]: With dead ends: 634 [2021-10-21 19:39:51,019 INFO L226 Difference]: Without dead ends: 581 [2021-10-21 19:39:51,019 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 276.3ms TimeCoverageRelationStatistics Valid=80, Invalid=160, Unknown=0, NotChecked=0, Total=240 [2021-10-21 19:39:51,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 581 states. [2021-10-21 19:39:51,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 581 to 579. [2021-10-21 19:39:51,029 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-10-21 19:39:51,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 579 states to 579 states and 682 transitions. [2021-10-21 19:39:51,038 INFO L78 Accepts]: Start accepts. Automaton has 579 states and 682 transitions. Word has length 81 [2021-10-21 19:39:51,038 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-21 19:39:51,039 INFO L470 AbstractCegarLoop]: Abstraction has 579 states and 682 transitions. [2021-10-21 19:39:51,039 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-10-21 19:39:51,039 INFO L276 IsEmpty]: Start isEmpty. Operand 579 states and 682 transitions. [2021-10-21 19:39:51,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2021-10-21 19:39:51,040 INFO L504 BasicCegarLoop]: Found error trace [2021-10-21 19:39:51,041 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-10-21 19:39:51,041 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2021-10-21 19:39:51,041 INFO L402 AbstractCegarLoop]: === Iteration 38 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2021-10-21 19:39:51,042 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-21 19:39:51,042 INFO L82 PathProgramCache]: Analyzing trace with hash 1681688182, now seen corresponding path program 1 times [2021-10-21 19:39:51,042 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-21 19:39:51,042 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1476642803] [2021-10-21 19:39:51,042 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-21 19:39:51,042 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-21 19:39:51,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:39:51,155 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-10-21 19:39:51,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:39:51,186 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-10-21 19:39:51,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:39:51,202 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-10-21 19:39:51,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:39:51,222 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-10-21 19:39:51,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:39:51,272 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2021-10-21 19:39:51,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:39:51,276 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-10-21 19:39:51,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:39:51,290 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2021-10-21 19:39:51,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:39:51,306 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2021-10-21 19:39:51,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:39:51,335 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-21 19:39:51,335 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-21 19:39:51,336 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1476642803] [2021-10-21 19:39:51,336 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1476642803] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-21 19:39:51,336 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-21 19:39:51,336 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2021-10-21 19:39:51,336 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1519426362] [2021-10-21 19:39:51,338 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2021-10-21 19:39:51,338 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-21 19:39:51,339 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-10-21 19:39:51,339 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=196, Unknown=0, NotChecked=0, Total=240 [2021-10-21 19:39:51,339 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-10-21 19:39:52,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-21 19:39:52,442 INFO L93 Difference]: Finished difference Result 580 states and 682 transitions. [2021-10-21 19:39:52,442 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-10-21 19:39:52,442 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-10-21 19:39:52,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-21 19:39:52,444 INFO L225 Difference]: With dead ends: 580 [2021-10-21 19:39:52,444 INFO L226 Difference]: Without dead ends: 495 [2021-10-21 19:39:52,445 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 266.2ms TimeCoverageRelationStatistics Valid=81, Invalid=381, Unknown=0, NotChecked=0, Total=462 [2021-10-21 19:39:52,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 495 states. [2021-10-21 19:39:52,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 495 to 493. [2021-10-21 19:39:52,453 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-10-21 19:39:52,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 493 states to 493 states and 582 transitions. [2021-10-21 19:39:52,455 INFO L78 Accepts]: Start accepts. Automaton has 493 states and 582 transitions. Word has length 90 [2021-10-21 19:39:52,455 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-21 19:39:52,455 INFO L470 AbstractCegarLoop]: Abstraction has 493 states and 582 transitions. [2021-10-21 19:39:52,455 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-10-21 19:39:52,455 INFO L276 IsEmpty]: Start isEmpty. Operand 493 states and 582 transitions. [2021-10-21 19:39:52,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2021-10-21 19:39:52,457 INFO L504 BasicCegarLoop]: Found error trace [2021-10-21 19:39:52,457 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-10-21 19:39:52,457 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2021-10-21 19:39:52,457 INFO L402 AbstractCegarLoop]: === Iteration 39 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2021-10-21 19:39:52,458 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-21 19:39:52,458 INFO L82 PathProgramCache]: Analyzing trace with hash 1266916623, now seen corresponding path program 1 times [2021-10-21 19:39:52,459 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-21 19:39:52,459 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [190152062] [2021-10-21 19:39:52,459 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-21 19:39:52,459 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-21 19:39:52,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:39:52,559 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-10-21 19:39:52,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:39:52,586 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-10-21 19:39:52,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:39:52,600 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-10-21 19:39:52,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:39:52,617 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-10-21 19:39:52,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:39:52,652 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-10-21 19:39:52,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:39:52,683 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-10-21 19:39:52,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:39:52,686 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-10-21 19:39:52,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:39:52,697 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-10-21 19:39:52,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:39:52,711 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2021-10-21 19:39:52,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:39:52,714 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2021-10-21 19:39:52,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:39:52,717 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-21 19:39:52,717 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-21 19:39:52,717 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [190152062] [2021-10-21 19:39:52,718 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [190152062] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-21 19:39:52,718 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-21 19:39:52,718 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2021-10-21 19:39:52,718 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [50432281] [2021-10-21 19:39:52,718 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2021-10-21 19:39:52,719 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-21 19:39:52,719 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-10-21 19:39:52,719 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=132, Unknown=0, NotChecked=0, Total=182 [2021-10-21 19:39:52,719 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-10-21 19:39:53,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-21 19:39:53,171 INFO L93 Difference]: Finished difference Result 491 states and 577 transitions. [2021-10-21 19:39:53,171 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-10-21 19:39:53,171 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-10-21 19:39:53,172 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-21 19:39:53,174 INFO L225 Difference]: With dead ends: 491 [2021-10-21 19:39:53,174 INFO L226 Difference]: Without dead ends: 489 [2021-10-21 19:39:53,174 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 192.7ms TimeCoverageRelationStatistics Valid=64, Invalid=176, Unknown=0, NotChecked=0, Total=240 [2021-10-21 19:39:53,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 489 states. [2021-10-21 19:39:53,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 489 to 436. [2021-10-21 19:39:53,182 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-10-21 19:39:53,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 436 states to 436 states and 509 transitions. [2021-10-21 19:39:53,183 INFO L78 Accepts]: Start accepts. Automaton has 436 states and 509 transitions. Word has length 96 [2021-10-21 19:39:53,184 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-21 19:39:53,184 INFO L470 AbstractCegarLoop]: Abstraction has 436 states and 509 transitions. [2021-10-21 19:39:53,184 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-10-21 19:39:53,184 INFO L276 IsEmpty]: Start isEmpty. Operand 436 states and 509 transitions. [2021-10-21 19:39:53,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2021-10-21 19:39:53,185 INFO L504 BasicCegarLoop]: Found error trace [2021-10-21 19:39:53,186 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-10-21 19:39:53,186 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2021-10-21 19:39:53,186 INFO L402 AbstractCegarLoop]: === Iteration 40 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2021-10-21 19:39:53,186 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-21 19:39:53,187 INFO L82 PathProgramCache]: Analyzing trace with hash -596239754, now seen corresponding path program 1 times [2021-10-21 19:39:53,187 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-21 19:39:53,187 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1380377143] [2021-10-21 19:39:53,187 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-21 19:39:53,187 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-21 19:39:53,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:39:53,307 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-10-21 19:39:53,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:39:53,336 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-10-21 19:39:53,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:39:53,352 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-10-21 19:39:53,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:39:53,374 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-10-21 19:39:53,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:39:53,427 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-10-21 19:39:53,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:39:53,444 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-10-21 19:39:53,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:39:53,446 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-10-21 19:39:53,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:39:53,459 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-10-21 19:39:53,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:39:53,474 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2021-10-21 19:39:53,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:39:53,481 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2021-10-21 19:39:53,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:39:53,484 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-21 19:39:53,484 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-21 19:39:53,484 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1380377143] [2021-10-21 19:39:53,484 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1380377143] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-21 19:39:53,485 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-21 19:39:53,485 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2021-10-21 19:39:53,485 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [681858217] [2021-10-21 19:39:53,485 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2021-10-21 19:39:53,486 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-21 19:39:53,486 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-10-21 19:39:53,486 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=158, Unknown=0, NotChecked=0, Total=210 [2021-10-21 19:39:53,486 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-10-21 19:39:54,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-21 19:39:54,660 INFO L93 Difference]: Finished difference Result 833 states and 977 transitions. [2021-10-21 19:39:54,660 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2021-10-21 19:39:54,660 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-10-21 19:39:54,661 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-21 19:39:54,664 INFO L225 Difference]: With dead ends: 833 [2021-10-21 19:39:54,664 INFO L226 Difference]: Without dead ends: 791 [2021-10-21 19:39:54,664 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 116 ImplicationChecksByTransitivity, 432.3ms TimeCoverageRelationStatistics Valid=167, Invalid=589, Unknown=0, NotChecked=0, Total=756 [2021-10-21 19:39:54,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 791 states. [2021-10-21 19:39:54,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 791 to 416. [2021-10-21 19:39:54,673 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-10-21 19:39:54,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 416 states to 416 states and 484 transitions. [2021-10-21 19:39:54,675 INFO L78 Accepts]: Start accepts. Automaton has 416 states and 484 transitions. Word has length 96 [2021-10-21 19:39:54,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-21 19:39:54,675 INFO L470 AbstractCegarLoop]: Abstraction has 416 states and 484 transitions. [2021-10-21 19:39:54,675 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-10-21 19:39:54,675 INFO L276 IsEmpty]: Start isEmpty. Operand 416 states and 484 transitions. [2021-10-21 19:39:54,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2021-10-21 19:39:54,677 INFO L504 BasicCegarLoop]: Found error trace [2021-10-21 19:39:54,677 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-10-21 19:39:54,677 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2021-10-21 19:39:54,677 INFO L402 AbstractCegarLoop]: === Iteration 41 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2021-10-21 19:39:54,678 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-21 19:39:54,678 INFO L82 PathProgramCache]: Analyzing trace with hash -693188859, now seen corresponding path program 1 times [2021-10-21 19:39:54,678 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-21 19:39:54,678 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [473602345] [2021-10-21 19:39:54,678 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-21 19:39:54,678 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-21 19:39:54,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:39:54,802 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-10-21 19:39:54,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:39:54,832 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-10-21 19:39:54,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:39:54,849 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-10-21 19:39:54,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:39:54,865 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-10-21 19:39:54,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:39:54,928 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2021-10-21 19:39:54,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:39:54,986 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-10-21 19:39:54,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:39:55,004 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-10-21 19:39:55,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:39:55,007 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-10-21 19:39:55,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:39:55,020 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-10-21 19:39:55,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:39:55,038 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2021-10-21 19:39:55,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:39:55,054 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-10-21 19:39:55,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:39:55,057 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2021-10-21 19:39:55,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:39:55,060 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-21 19:39:55,061 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-21 19:39:55,061 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [473602345] [2021-10-21 19:39:55,061 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [473602345] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-21 19:39:55,061 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-21 19:39:55,061 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2021-10-21 19:39:55,062 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1247037174] [2021-10-21 19:39:55,062 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2021-10-21 19:39:55,062 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-21 19:39:55,062 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-10-21 19:39:55,063 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=269, Unknown=0, NotChecked=0, Total=342 [2021-10-21 19:39:55,063 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-10-21 19:39:55,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-21 19:39:55,760 INFO L93 Difference]: Finished difference Result 461 states and 538 transitions. [2021-10-21 19:39:55,760 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-10-21 19:39:55,760 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-10-21 19:39:55,761 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-21 19:39:55,762 INFO L225 Difference]: With dead ends: 461 [2021-10-21 19:39:55,762 INFO L226 Difference]: Without dead ends: 435 [2021-10-21 19:39:55,763 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 325.6ms TimeCoverageRelationStatistics Valid=114, Invalid=438, Unknown=0, NotChecked=0, Total=552 [2021-10-21 19:39:55,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 435 states. [2021-10-21 19:39:55,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 435 to 425. [2021-10-21 19:39:55,771 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-10-21 19:39:55,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 425 states to 425 states and 490 transitions. [2021-10-21 19:39:55,772 INFO L78 Accepts]: Start accepts. Automaton has 425 states and 490 transitions. Word has length 101 [2021-10-21 19:39:55,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-21 19:39:55,772 INFO L470 AbstractCegarLoop]: Abstraction has 425 states and 490 transitions. [2021-10-21 19:39:55,773 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-10-21 19:39:55,773 INFO L276 IsEmpty]: Start isEmpty. Operand 425 states and 490 transitions. [2021-10-21 19:39:55,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2021-10-21 19:39:55,774 INFO L504 BasicCegarLoop]: Found error trace [2021-10-21 19:39:55,774 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-10-21 19:39:55,774 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2021-10-21 19:39:55,775 INFO L402 AbstractCegarLoop]: === Iteration 42 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2021-10-21 19:39:55,775 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-21 19:39:55,775 INFO L82 PathProgramCache]: Analyzing trace with hash 1496072861, now seen corresponding path program 1 times [2021-10-21 19:39:55,775 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-21 19:39:55,775 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1279801577] [2021-10-21 19:39:55,776 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-21 19:39:55,776 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-21 19:39:55,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:39:55,886 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-10-21 19:39:55,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:39:55,916 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-10-21 19:39:55,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:39:55,929 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-10-21 19:39:55,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:39:55,939 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2021-10-21 19:39:55,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:39:55,949 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-10-21 19:39:55,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:39:55,951 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-10-21 19:39:55,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:39:55,960 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-10-21 19:39:55,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:39:55,971 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2021-10-21 19:39:55,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:39:56,010 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-10-21 19:39:56,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:39:56,013 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2021-10-21 19:39:56,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:39:56,054 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-10-21 19:39:56,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:39:56,057 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-10-21 19:39:56,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:39:56,060 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-10-21 19:39:56,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:39:56,062 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2021-10-21 19:39:56,062 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-21 19:39:56,062 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1279801577] [2021-10-21 19:39:56,063 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1279801577] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-21 19:39:56,063 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-21 19:39:56,063 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2021-10-21 19:39:56,063 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [726050226] [2021-10-21 19:39:56,064 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2021-10-21 19:39:56,064 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-21 19:39:56,064 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-10-21 19:39:56,064 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=133, Unknown=0, NotChecked=0, Total=182 [2021-10-21 19:39:56,064 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-10-21 19:39:56,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-21 19:39:56,685 INFO L93 Difference]: Finished difference Result 376 states and 423 transitions. [2021-10-21 19:39:56,685 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-10-21 19:39:56,686 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-10-21 19:39:56,686 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-21 19:39:56,687 INFO L225 Difference]: With dead ends: 376 [2021-10-21 19:39:56,687 INFO L226 Difference]: Without dead ends: 376 [2021-10-21 19:39:56,687 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 216.0ms TimeCoverageRelationStatistics Valid=75, Invalid=231, Unknown=0, NotChecked=0, Total=306 [2021-10-21 19:39:56,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 376 states. [2021-10-21 19:39:56,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 376 to 242. [2021-10-21 19:39:56,696 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-10-21 19:39:56,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 242 states to 242 states and 268 transitions. [2021-10-21 19:39:56,697 INFO L78 Accepts]: Start accepts. Automaton has 242 states and 268 transitions. Word has length 110 [2021-10-21 19:39:56,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-21 19:39:56,697 INFO L470 AbstractCegarLoop]: Abstraction has 242 states and 268 transitions. [2021-10-21 19:39:56,698 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-10-21 19:39:56,698 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 268 transitions. [2021-10-21 19:39:56,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2021-10-21 19:39:56,699 INFO L504 BasicCegarLoop]: Found error trace [2021-10-21 19:39:56,699 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-10-21 19:39:56,699 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2021-10-21 19:39:56,699 INFO L402 AbstractCegarLoop]: === Iteration 43 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2021-10-21 19:39:56,700 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-21 19:39:56,700 INFO L82 PathProgramCache]: Analyzing trace with hash -1225581856, now seen corresponding path program 1 times [2021-10-21 19:39:56,700 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-21 19:39:56,700 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [580699033] [2021-10-21 19:39:56,700 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-21 19:39:56,700 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-21 19:39:56,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:39:56,809 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-10-21 19:39:56,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:39:56,834 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-10-21 19:39:56,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:39:56,845 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-10-21 19:39:56,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:39:56,870 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-10-21 19:39:56,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:39:56,917 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2021-10-21 19:39:56,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:39:56,967 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-10-21 19:39:56,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:39:56,980 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-10-21 19:39:56,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:39:56,983 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-10-21 19:39:56,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:39:56,995 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-10-21 19:39:56,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:39:57,011 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2021-10-21 19:39:57,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:39:57,026 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-10-21 19:39:57,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:39:57,029 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2021-10-21 19:39:57,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:39:57,049 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2021-10-21 19:39:57,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:39:57,052 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-21 19:39:57,052 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-21 19:39:57,054 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [580699033] [2021-10-21 19:39:57,054 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [580699033] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-21 19:39:57,054 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-21 19:39:57,054 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2021-10-21 19:39:57,054 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [299681265] [2021-10-21 19:39:57,055 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2021-10-21 19:39:57,056 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-21 19:39:57,056 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-10-21 19:39:57,056 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=145, Unknown=0, NotChecked=0, Total=210 [2021-10-21 19:39:57,057 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-10-21 19:39:57,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-21 19:39:57,704 INFO L93 Difference]: Finished difference Result 256 states and 284 transitions. [2021-10-21 19:39:57,704 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-10-21 19:39:57,704 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-10-21 19:39:57,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-21 19:39:57,706 INFO L225 Difference]: With dead ends: 256 [2021-10-21 19:39:57,706 INFO L226 Difference]: Without dead ends: 256 [2021-10-21 19:39:57,706 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 320.2ms TimeCoverageRelationStatistics Valid=114, Invalid=228, Unknown=0, NotChecked=0, Total=342 [2021-10-21 19:39:57,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 256 states. [2021-10-21 19:39:57,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 256 to 246. [2021-10-21 19:39:57,710 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-10-21 19:39:57,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 246 states to 246 states and 272 transitions. [2021-10-21 19:39:57,711 INFO L78 Accepts]: Start accepts. Automaton has 246 states and 272 transitions. Word has length 117 [2021-10-21 19:39:57,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-21 19:39:57,712 INFO L470 AbstractCegarLoop]: Abstraction has 246 states and 272 transitions. [2021-10-21 19:39:57,712 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-10-21 19:39:57,712 INFO L276 IsEmpty]: Start isEmpty. Operand 246 states and 272 transitions. [2021-10-21 19:39:57,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2021-10-21 19:39:57,713 INFO L504 BasicCegarLoop]: Found error trace [2021-10-21 19:39:57,714 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-21 19:39:57,714 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2021-10-21 19:39:57,714 INFO L402 AbstractCegarLoop]: === Iteration 44 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2021-10-21 19:39:57,714 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-21 19:39:57,714 INFO L82 PathProgramCache]: Analyzing trace with hash -1044095359, now seen corresponding path program 1 times [2021-10-21 19:39:57,715 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-21 19:39:57,715 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [633568030] [2021-10-21 19:39:57,715 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-21 19:39:57,715 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-21 19:39:57,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:39:57,833 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-10-21 19:39:57,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:39:57,858 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-10-21 19:39:57,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:39:57,871 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-10-21 19:39:57,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:39:57,886 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-10-21 19:39:57,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:39:57,923 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2021-10-21 19:39:57,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:39:57,966 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-10-21 19:39:57,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:39:57,978 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-10-21 19:39:57,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:39:57,981 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-10-21 19:39:57,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:39:57,991 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-10-21 19:39:57,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:39:58,004 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2021-10-21 19:39:58,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:39:58,027 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-10-21 19:39:58,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:39:58,029 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2021-10-21 19:39:58,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:39:58,032 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2021-10-21 19:39:58,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:39:58,034 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-21 19:39:58,035 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-21 19:39:58,035 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [633568030] [2021-10-21 19:39:58,035 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [633568030] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-21 19:39:58,035 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-21 19:39:58,035 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2021-10-21 19:39:58,035 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [673746215] [2021-10-21 19:39:58,036 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2021-10-21 19:39:58,036 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-21 19:39:58,036 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-10-21 19:39:58,036 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=145, Unknown=0, NotChecked=0, Total=210 [2021-10-21 19:39:58,037 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-10-21 19:39:58,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-21 19:39:58,525 INFO L93 Difference]: Finished difference Result 256 states and 282 transitions. [2021-10-21 19:39:58,526 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-10-21 19:39:58,526 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-10-21 19:39:58,526 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-21 19:39:58,527 INFO L225 Difference]: With dead ends: 256 [2021-10-21 19:39:58,527 INFO L226 Difference]: Without dead ends: 252 [2021-10-21 19:39:58,527 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 249.5ms TimeCoverageRelationStatistics Valid=104, Invalid=238, Unknown=0, NotChecked=0, Total=342 [2021-10-21 19:39:58,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 252 states. [2021-10-21 19:39:58,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 252 to 246. [2021-10-21 19:39:58,530 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-10-21 19:39:58,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 246 states to 246 states and 271 transitions. [2021-10-21 19:39:58,531 INFO L78 Accepts]: Start accepts. Automaton has 246 states and 271 transitions. Word has length 117 [2021-10-21 19:39:58,531 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-21 19:39:58,532 INFO L470 AbstractCegarLoop]: Abstraction has 246 states and 271 transitions. [2021-10-21 19:39:58,532 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-10-21 19:39:58,532 INFO L276 IsEmpty]: Start isEmpty. Operand 246 states and 271 transitions. [2021-10-21 19:39:58,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2021-10-21 19:39:58,533 INFO L504 BasicCegarLoop]: Found error trace [2021-10-21 19:39:58,534 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-10-21 19:39:58,534 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2021-10-21 19:39:58,534 INFO L402 AbstractCegarLoop]: === Iteration 45 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2021-10-21 19:39:58,534 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-21 19:39:58,534 INFO L82 PathProgramCache]: Analyzing trace with hash 1109919017, now seen corresponding path program 1 times [2021-10-21 19:39:58,535 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-21 19:39:58,535 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1349584411] [2021-10-21 19:39:58,535 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-21 19:39:58,535 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-21 19:39:58,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:39:58,675 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-10-21 19:39:58,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:39:58,709 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-10-21 19:39:58,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:39:58,726 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-10-21 19:39:58,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:39:58,746 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-10-21 19:39:58,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:39:58,835 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2021-10-21 19:39:58,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:39:58,917 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-10-21 19:39:58,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:39:58,938 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-10-21 19:39:58,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:39:58,941 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-10-21 19:39:58,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:39:58,954 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-10-21 19:39:58,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:39:58,972 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2021-10-21 19:39:58,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:39:59,050 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-10-21 19:39:59,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:39:59,053 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2021-10-21 19:39:59,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:39:59,097 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-10-21 19:39:59,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:39:59,099 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-10-21 19:39:59,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:39:59,101 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-10-21 19:39:59,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:39:59,103 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2021-10-21 19:39:59,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:39:59,114 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2021-10-21 19:39:59,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:39:59,118 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2021-10-21 19:39:59,118 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-21 19:39:59,118 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1349584411] [2021-10-21 19:39:59,118 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1349584411] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-21 19:39:59,118 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-21 19:39:59,118 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [25] imperfect sequences [] total 25 [2021-10-21 19:39:59,119 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1926516381] [2021-10-21 19:39:59,119 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2021-10-21 19:39:59,119 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-21 19:39:59,120 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2021-10-21 19:39:59,120 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=515, Unknown=0, NotChecked=0, Total=600 [2021-10-21 19:39:59,120 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-10-21 19:40:00,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-21 19:40:00,016 INFO L93 Difference]: Finished difference Result 315 states and 356 transitions. [2021-10-21 19:40:00,017 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2021-10-21 19:40:00,017 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-10-21 19:40:00,017 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-21 19:40:00,018 INFO L225 Difference]: With dead ends: 315 [2021-10-21 19:40:00,019 INFO L226 Difference]: Without dead ends: 283 [2021-10-21 19:40:00,019 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 165 ImplicationChecksByTransitivity, 496.2ms TimeCoverageRelationStatistics Valid=148, Invalid=1042, Unknown=0, NotChecked=0, Total=1190 [2021-10-21 19:40:00,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 283 states. [2021-10-21 19:40:00,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 283 to 263. [2021-10-21 19:40:00,023 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-10-21 19:40:00,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 263 states to 263 states and 292 transitions. [2021-10-21 19:40:00,024 INFO L78 Accepts]: Start accepts. Automaton has 263 states and 292 transitions. Word has length 147 [2021-10-21 19:40:00,024 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-21 19:40:00,024 INFO L470 AbstractCegarLoop]: Abstraction has 263 states and 292 transitions. [2021-10-21 19:40:00,024 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-10-21 19:40:00,024 INFO L276 IsEmpty]: Start isEmpty. Operand 263 states and 292 transitions. [2021-10-21 19:40:00,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2021-10-21 19:40:00,026 INFO L504 BasicCegarLoop]: Found error trace [2021-10-21 19:40:00,026 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-10-21 19:40:00,026 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2021-10-21 19:40:00,026 INFO L402 AbstractCegarLoop]: === Iteration 46 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2021-10-21 19:40:00,027 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-21 19:40:00,027 INFO L82 PathProgramCache]: Analyzing trace with hash 2025391703, now seen corresponding path program 1 times [2021-10-21 19:40:00,027 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-21 19:40:00,027 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [544275708] [2021-10-21 19:40:00,027 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-21 19:40:00,027 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-21 19:40:00,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:40:00,156 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-10-21 19:40:00,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:40:00,192 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-10-21 19:40:00,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:40:00,209 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-10-21 19:40:00,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:40:00,228 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-10-21 19:40:00,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:40:00,305 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2021-10-21 19:40:00,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:40:00,369 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-10-21 19:40:00,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:40:00,386 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-10-21 19:40:00,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:40:00,389 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-10-21 19:40:00,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:40:00,403 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-10-21 19:40:00,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:40:00,423 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2021-10-21 19:40:00,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:40:00,494 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-10-21 19:40:00,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:40:00,497 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2021-10-21 19:40:00,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:40:00,540 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-10-21 19:40:00,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:40:00,543 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-10-21 19:40:00,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:40:00,545 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-10-21 19:40:00,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:40:00,548 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2021-10-21 19:40:00,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:40:00,550 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2021-10-21 19:40:00,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:40:00,553 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2021-10-21 19:40:00,553 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-21 19:40:00,554 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [544275708] [2021-10-21 19:40:00,554 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [544275708] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-21 19:40:00,554 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-21 19:40:00,554 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [24] imperfect sequences [] total 24 [2021-10-21 19:40:00,554 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [524977051] [2021-10-21 19:40:00,555 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2021-10-21 19:40:00,555 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-21 19:40:00,555 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2021-10-21 19:40:00,556 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=469, Unknown=0, NotChecked=0, Total=552 [2021-10-21 19:40:00,556 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-10-21 19:40:01,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-21 19:40:01,386 INFO L93 Difference]: Finished difference Result 282 states and 313 transitions. [2021-10-21 19:40:01,387 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2021-10-21 19:40:01,387 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-10-21 19:40:01,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-21 19:40:01,388 INFO L225 Difference]: With dead ends: 282 [2021-10-21 19:40:01,388 INFO L226 Difference]: Without dead ends: 277 [2021-10-21 19:40:01,388 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 122 ImplicationChecksByTransitivity, 415.2ms TimeCoverageRelationStatistics Valid=130, Invalid=740, Unknown=0, NotChecked=0, Total=870 [2021-10-21 19:40:01,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 277 states. [2021-10-21 19:40:01,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 277 to 263. [2021-10-21 19:40:01,392 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-10-21 19:40:01,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 263 states to 263 states and 291 transitions. [2021-10-21 19:40:01,393 INFO L78 Accepts]: Start accepts. Automaton has 263 states and 291 transitions. Word has length 148 [2021-10-21 19:40:01,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-21 19:40:01,393 INFO L470 AbstractCegarLoop]: Abstraction has 263 states and 291 transitions. [2021-10-21 19:40:01,393 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-10-21 19:40:01,394 INFO L276 IsEmpty]: Start isEmpty. Operand 263 states and 291 transitions. [2021-10-21 19:40:01,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2021-10-21 19:40:01,395 INFO L504 BasicCegarLoop]: Found error trace [2021-10-21 19:40:01,395 INFO L512 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-21 19:40:01,395 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45 [2021-10-21 19:40:01,395 INFO L402 AbstractCegarLoop]: === Iteration 47 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2021-10-21 19:40:01,396 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-21 19:40:01,396 INFO L82 PathProgramCache]: Analyzing trace with hash 1867828009, now seen corresponding path program 1 times [2021-10-21 19:40:01,396 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-21 19:40:01,396 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [576633080] [2021-10-21 19:40:01,396 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-21 19:40:01,397 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-21 19:40:01,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:40:01,526 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-10-21 19:40:01,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:40:01,556 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-10-21 19:40:01,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:40:01,573 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-10-21 19:40:01,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:40:01,593 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-10-21 19:40:01,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:40:01,665 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2021-10-21 19:40:01,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:40:01,736 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-10-21 19:40:01,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:40:01,753 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-10-21 19:40:01,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:40:01,756 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-10-21 19:40:01,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:40:01,771 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-10-21 19:40:01,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:40:01,791 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2021-10-21 19:40:01,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:40:01,810 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-10-21 19:40:01,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:40:01,813 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2021-10-21 19:40:01,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:40:01,818 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-10-21 19:40:01,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:40:01,820 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-10-21 19:40:01,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:40:01,822 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-10-21 19:40:01,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:40:01,825 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2021-10-21 19:40:01,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:40:01,843 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2021-10-21 19:40:01,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:40:01,846 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2021-10-21 19:40:01,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:40:01,849 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2021-10-21 19:40:01,849 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-21 19:40:01,849 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [576633080] [2021-10-21 19:40:01,849 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [576633080] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-21 19:40:01,850 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-21 19:40:01,850 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2021-10-21 19:40:01,850 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1087169552] [2021-10-21 19:40:01,850 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2021-10-21 19:40:01,851 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-21 19:40:01,851 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2021-10-21 19:40:01,851 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=343, Unknown=0, NotChecked=0, Total=420 [2021-10-21 19:40:01,851 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-10-21 19:40:02,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-21 19:40:02,601 INFO L93 Difference]: Finished difference Result 301 states and 336 transitions. [2021-10-21 19:40:02,602 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2021-10-21 19:40:02,602 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-10-21 19:40:02,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-21 19:40:02,603 INFO L225 Difference]: With dead ends: 301 [2021-10-21 19:40:02,603 INFO L226 Difference]: Without dead ends: 263 [2021-10-21 19:40:02,603 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 100 ImplicationChecksByTransitivity, 450.7ms TimeCoverageRelationStatistics Valid=141, Invalid=671, Unknown=0, NotChecked=0, Total=812 [2021-10-21 19:40:02,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 263 states. [2021-10-21 19:40:02,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 263 to 257. [2021-10-21 19:40:02,607 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-10-21 19:40:02,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 257 states to 257 states and 282 transitions. [2021-10-21 19:40:02,608 INFO L78 Accepts]: Start accepts. Automaton has 257 states and 282 transitions. Word has length 150 [2021-10-21 19:40:02,608 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-21 19:40:02,608 INFO L470 AbstractCegarLoop]: Abstraction has 257 states and 282 transitions. [2021-10-21 19:40:02,609 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-10-21 19:40:02,609 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 282 transitions. [2021-10-21 19:40:02,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2021-10-21 19:40:02,610 INFO L504 BasicCegarLoop]: Found error trace [2021-10-21 19:40:02,610 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-10-21 19:40:02,611 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46 [2021-10-21 19:40:02,611 INFO L402 AbstractCegarLoop]: === Iteration 48 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2021-10-21 19:40:02,611 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-21 19:40:02,611 INFO L82 PathProgramCache]: Analyzing trace with hash -495529015, now seen corresponding path program 1 times [2021-10-21 19:40:02,611 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-21 19:40:02,612 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1653142854] [2021-10-21 19:40:02,612 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-21 19:40:02,612 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-21 19:40:02,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:40:02,732 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-10-21 19:40:02,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:40:02,760 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-10-21 19:40:02,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:40:02,776 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-10-21 19:40:02,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:40:02,795 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-10-21 19:40:02,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:40:02,853 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2021-10-21 19:40:02,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:40:02,895 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-10-21 19:40:02,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:40:02,907 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-10-21 19:40:02,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:40:02,910 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-10-21 19:40:02,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:40:02,935 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-10-21 19:40:02,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:40:02,953 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2021-10-21 19:40:02,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:40:02,974 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-10-21 19:40:02,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:40:02,977 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2021-10-21 19:40:02,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:40:02,981 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-10-21 19:40:02,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:40:02,984 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-10-21 19:40:02,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:40:02,986 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-10-21 19:40:02,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:40:02,988 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2021-10-21 19:40:02,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:40:02,990 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2021-10-21 19:40:02,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:40:02,993 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2021-10-21 19:40:02,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:40:02,996 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2021-10-21 19:40:02,996 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-21 19:40:02,996 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1653142854] [2021-10-21 19:40:02,996 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1653142854] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-21 19:40:02,996 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-21 19:40:02,996 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2021-10-21 19:40:02,997 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [246987700] [2021-10-21 19:40:02,997 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2021-10-21 19:40:02,997 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-21 19:40:02,998 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-10-21 19:40:02,998 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=145, Unknown=0, NotChecked=0, Total=210 [2021-10-21 19:40:02,998 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-10-21 19:40:03,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-21 19:40:03,671 INFO L93 Difference]: Finished difference Result 254 states and 276 transitions. [2021-10-21 19:40:03,671 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-10-21 19:40:03,672 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-10-21 19:40:03,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-21 19:40:03,673 INFO L225 Difference]: With dead ends: 254 [2021-10-21 19:40:03,673 INFO L226 Difference]: Without dead ends: 243 [2021-10-21 19:40:03,673 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 77 ImplicationChecksByTransitivity, 372.1ms TimeCoverageRelationStatistics Valid=147, Invalid=405, Unknown=0, NotChecked=0, Total=552 [2021-10-21 19:40:03,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 243 states. [2021-10-21 19:40:03,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 243 to 229. [2021-10-21 19:40:03,685 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-10-21 19:40:03,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 229 states to 229 states and 248 transitions. [2021-10-21 19:40:03,686 INFO L78 Accepts]: Start accepts. Automaton has 229 states and 248 transitions. Word has length 155 [2021-10-21 19:40:03,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-21 19:40:03,686 INFO L470 AbstractCegarLoop]: Abstraction has 229 states and 248 transitions. [2021-10-21 19:40:03,686 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-10-21 19:40:03,687 INFO L276 IsEmpty]: Start isEmpty. Operand 229 states and 248 transitions. [2021-10-21 19:40:03,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2021-10-21 19:40:03,688 INFO L504 BasicCegarLoop]: Found error trace [2021-10-21 19:40:03,688 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-10-21 19:40:03,688 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47 [2021-10-21 19:40:03,690 INFO L402 AbstractCegarLoop]: === Iteration 49 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2021-10-21 19:40:03,691 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-21 19:40:03,691 INFO L82 PathProgramCache]: Analyzing trace with hash -1029557280, now seen corresponding path program 1 times [2021-10-21 19:40:03,691 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-21 19:40:03,691 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [666965434] [2021-10-21 19:40:03,691 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-21 19:40:03,692 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-21 19:40:03,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:40:03,822 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-10-21 19:40:03,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:40:03,847 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-10-21 19:40:03,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:40:03,860 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-10-21 19:40:03,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:40:03,875 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-10-21 19:40:03,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:40:03,919 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2021-10-21 19:40:03,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:40:03,967 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-10-21 19:40:03,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:40:03,977 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-10-21 19:40:03,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:40:03,980 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-10-21 19:40:03,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:40:03,988 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-10-21 19:40:03,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:40:04,000 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2021-10-21 19:40:04,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:40:04,035 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-10-21 19:40:04,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:40:04,038 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2021-10-21 19:40:04,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:40:04,062 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-10-21 19:40:04,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:40:04,065 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-10-21 19:40:04,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:40:04,067 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-10-21 19:40:04,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:40:04,082 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2021-10-21 19:40:04,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:40:04,086 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2021-10-21 19:40:04,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:40:04,088 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2021-10-21 19:40:04,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:40:04,091 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2021-10-21 19:40:04,091 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-21 19:40:04,091 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [666965434] [2021-10-21 19:40:04,091 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [666965434] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-21 19:40:04,091 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-21 19:40:04,092 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2021-10-21 19:40:04,092 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1181234027] [2021-10-21 19:40:04,092 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2021-10-21 19:40:04,092 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-21 19:40:04,093 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2021-10-21 19:40:04,093 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=194, Unknown=0, NotChecked=0, Total=272 [2021-10-21 19:40:04,093 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-10-21 19:40:04,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-21 19:40:04,660 INFO L93 Difference]: Finished difference Result 218 states and 234 transitions. [2021-10-21 19:40:04,661 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-10-21 19:40:04,661 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-10-21 19:40:04,661 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-21 19:40:04,662 INFO L225 Difference]: With dead ends: 218 [2021-10-21 19:40:04,662 INFO L226 Difference]: Without dead ends: 208 [2021-10-21 19:40:04,662 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 92 ImplicationChecksByTransitivity, 271.8ms TimeCoverageRelationStatistics Valid=124, Invalid=338, Unknown=0, NotChecked=0, Total=462 [2021-10-21 19:40:04,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 208 states. [2021-10-21 19:40:04,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 208 to 208. [2021-10-21 19:40:04,664 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-10-21 19:40:04,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 223 transitions. [2021-10-21 19:40:04,665 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 223 transitions. Word has length 157 [2021-10-21 19:40:04,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-21 19:40:04,666 INFO L470 AbstractCegarLoop]: Abstraction has 208 states and 223 transitions. [2021-10-21 19:40:04,666 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-10-21 19:40:04,666 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 223 transitions. [2021-10-21 19:40:04,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2021-10-21 19:40:04,667 INFO L504 BasicCegarLoop]: Found error trace [2021-10-21 19:40:04,667 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-10-21 19:40:04,667 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable48 [2021-10-21 19:40:04,668 INFO L402 AbstractCegarLoop]: === Iteration 50 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2021-10-21 19:40:04,668 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-21 19:40:04,668 INFO L82 PathProgramCache]: Analyzing trace with hash -1506473619, now seen corresponding path program 1 times [2021-10-21 19:40:04,668 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-21 19:40:04,668 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1139430513] [2021-10-21 19:40:04,669 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-21 19:40:04,669 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-21 19:40:04,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:40:04,793 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-10-21 19:40:04,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:40:04,821 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-10-21 19:40:04,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:40:04,837 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-10-21 19:40:04,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:40:04,856 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-10-21 19:40:04,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:40:04,935 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2021-10-21 19:40:04,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:40:04,993 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-10-21 19:40:04,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:40:05,008 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-10-21 19:40:05,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:40:05,011 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-10-21 19:40:05,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:40:05,029 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-10-21 19:40:05,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:40:05,045 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2021-10-21 19:40:05,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:40:05,087 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-10-21 19:40:05,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:40:05,090 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2021-10-21 19:40:05,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:40:05,095 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-10-21 19:40:05,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:40:05,097 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-10-21 19:40:05,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:40:05,099 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-10-21 19:40:05,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:40:05,121 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2021-10-21 19:40:05,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:40:05,124 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2021-10-21 19:40:05,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:40:05,127 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2021-10-21 19:40:05,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:40:05,130 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2021-10-21 19:40:05,130 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-21 19:40:05,130 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1139430513] [2021-10-21 19:40:05,130 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1139430513] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-21 19:40:05,131 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-21 19:40:05,131 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2021-10-21 19:40:05,131 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [943058781] [2021-10-21 19:40:05,131 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2021-10-21 19:40:05,131 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-21 19:40:05,132 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2021-10-21 19:40:05,132 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=293, Unknown=0, NotChecked=0, Total=380 [2021-10-21 19:40:05,132 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-10-21 19:40:06,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-21 19:40:06,475 INFO L93 Difference]: Finished difference Result 351 states and 375 transitions. [2021-10-21 19:40:06,476 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2021-10-21 19:40:06,476 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-10-21 19:40:06,476 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-21 19:40:06,477 INFO L225 Difference]: With dead ends: 351 [2021-10-21 19:40:06,477 INFO L226 Difference]: Without dead ends: 211 [2021-10-21 19:40:06,478 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 541 ImplicationChecksByTransitivity, 795.7ms TimeCoverageRelationStatistics Valid=387, Invalid=1965, Unknown=0, NotChecked=0, Total=2352 [2021-10-21 19:40:06,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2021-10-21 19:40:06,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 208. [2021-10-21 19:40:06,481 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-10-21 19:40:06,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 222 transitions. [2021-10-21 19:40:06,481 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 222 transitions. Word has length 158 [2021-10-21 19:40:06,481 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-21 19:40:06,482 INFO L470 AbstractCegarLoop]: Abstraction has 208 states and 222 transitions. [2021-10-21 19:40:06,482 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-10-21 19:40:06,482 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 222 transitions. [2021-10-21 19:40:06,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2021-10-21 19:40:06,483 INFO L504 BasicCegarLoop]: Found error trace [2021-10-21 19:40:06,483 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-10-21 19:40:06,483 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable49 [2021-10-21 19:40:06,483 INFO L402 AbstractCegarLoop]: === Iteration 51 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2021-10-21 19:40:06,483 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-21 19:40:06,484 INFO L82 PathProgramCache]: Analyzing trace with hash 424652015, now seen corresponding path program 1 times [2021-10-21 19:40:06,484 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-21 19:40:06,484 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1039810146] [2021-10-21 19:40:06,484 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-21 19:40:06,484 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-21 19:40:06,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:40:06,636 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-10-21 19:40:06,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:40:06,666 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-10-21 19:40:06,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:40:06,680 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-10-21 19:40:06,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:40:06,696 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-10-21 19:40:06,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:40:06,813 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2021-10-21 19:40:06,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:40:06,895 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-10-21 19:40:06,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:40:06,915 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-10-21 19:40:06,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:40:06,918 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-10-21 19:40:06,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:40:06,936 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-10-21 19:40:06,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:40:06,958 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2021-10-21 19:40:06,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:40:07,014 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-10-21 19:40:07,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:40:07,017 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2021-10-21 19:40:07,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:40:07,021 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-10-21 19:40:07,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:40:07,024 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-10-21 19:40:07,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:40:07,026 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-10-21 19:40:07,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:40:07,048 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2021-10-21 19:40:07,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:40:07,053 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2021-10-21 19:40:07,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:40:07,056 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2021-10-21 19:40:07,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:40:07,059 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2021-10-21 19:40:07,059 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-21 19:40:07,059 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1039810146] [2021-10-21 19:40:07,059 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1039810146] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-21 19:40:07,059 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-21 19:40:07,060 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [26] imperfect sequences [] total 26 [2021-10-21 19:40:07,060 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2143001428] [2021-10-21 19:40:07,060 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2021-10-21 19:40:07,060 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-21 19:40:07,061 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2021-10-21 19:40:07,061 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=103, Invalid=547, Unknown=0, NotChecked=0, Total=650 [2021-10-21 19:40:07,061 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-10-21 19:40:08,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-21 19:40:08,219 INFO L93 Difference]: Finished difference Result 208 states and 223 transitions. [2021-10-21 19:40:08,220 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2021-10-21 19:40:08,220 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-10-21 19:40:08,220 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-21 19:40:08,221 INFO L225 Difference]: With dead ends: 208 [2021-10-21 19:40:08,221 INFO L226 Difference]: Without dead ends: 0 [2021-10-21 19:40:08,221 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 352 ImplicationChecksByTransitivity, 773.7ms TimeCoverageRelationStatistics Valid=287, Invalid=1783, Unknown=0, NotChecked=0, Total=2070 [2021-10-21 19:40:08,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2021-10-21 19:40:08,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2021-10-21 19:40:08,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-21 19:40:08,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2021-10-21 19:40:08,222 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 158 [2021-10-21 19:40:08,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-21 19:40:08,222 INFO L470 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-10-21 19:40:08,222 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-10-21 19:40:08,222 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2021-10-21 19:40:08,222 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-10-21 19:40:08,224 INFO L764 garLoopResultBuilder]: Registering result SAFE for location mainErr0ENSURES_VIOLATIONMEMORY_LEAK [2021-10-21 19:40:08,224 INFO L764 garLoopResultBuilder]: Registering result SAFE for location errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK [2021-10-21 19:40:08,225 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50 [2021-10-21 19:40:08,227 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-10-21 19:40:08,229 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 21.10 07:40:08 BoogieIcfgContainer [2021-10-21 19:40:08,229 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-10-21 19:40:08,229 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-10-21 19:40:08,229 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-10-21 19:40:08,229 INFO L275 PluginConnector]: Witness Printer initialized [2021-10-21 19:40:08,230 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.10 07:38:55" (3/4) ... [2021-10-21 19:40:08,232 INFO L137 WitnessPrinter]: Generating witness for correct program [2021-10-21 19:40:08,237 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure reach_error [2021-10-21 19:40:08,238 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure IoRegisterDeviceInterface [2021-10-21 19:40:08,238 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure _BLAST_init [2021-10-21 19:40:08,238 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure FloppyProcessQueuedRequests [2021-10-21 19:40:08,238 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure IoSetDeviceInterfaceState [2021-10-21 19:40:08,238 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure FloppyPnp [2021-10-21 19:40:08,239 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2021-10-21 19:40:08,239 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure FloppyCreateClose [2021-10-21 19:40:08,239 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure stubMoreProcessingRequired [2021-10-21 19:40:08,239 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure FloppyPnpComplete [2021-10-21 19:40:08,239 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure KeWaitForSingleObject [2021-10-21 19:40:08,239 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure IofCompleteRequest [2021-10-21 19:40:08,239 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure FloppyStartDevice [2021-10-21 19:40:08,239 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure PsCreateSystemThread [2021-10-21 19:40:08,240 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ObReferenceObjectByHandle [2021-10-21 19:40:08,240 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure IoBuildDeviceIoControlRequest [2021-10-21 19:40:08,240 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure KeSetEvent [2021-10-21 19:40:08,240 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure stub_driver_init [2021-10-21 19:40:08,240 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure errorFn [2021-10-21 19:40:08,240 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure FlQueueIrpToThread [2021-10-21 19:40:08,240 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure IofCallDriver [2021-10-21 19:40:08,240 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2021-10-21 19:40:08,241 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure FlFdcDeviceIo [2021-10-21 19:40:08,241 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure FlAcpiConfigureFloppy [2021-10-21 19:40:08,241 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure IoDeleteSymbolicLink [2021-10-21 19:40:08,241 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure IoQueryDeviceDescription [2021-10-21 19:40:08,241 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ZwClose [2021-10-21 19:40:08,273 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 78 nodes and edges [2021-10-21 19:40:08,276 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 45 nodes and edges [2021-10-21 19:40:08,278 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2021-10-21 19:40:08,280 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2021-10-21 19:40:08,435 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8416fbd5-b9f1-43e7-8f6b-358922e2d2bf/bin/uautomizer-j4sWxH34Be/witness.graphml [2021-10-21 19:40:08,435 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-10-21 19:40:08,437 INFO L168 Benchmark]: Toolchain (without parser) took 74849.25 ms. Allocated memory was 117.4 MB in the beginning and 211.8 MB in the end (delta: 94.4 MB). Free memory was 82.7 MB in the beginning and 75.7 MB in the end (delta: 7.0 MB). Peak memory consumption was 102.1 MB. Max. memory is 16.1 GB. [2021-10-21 19:40:08,438 INFO L168 Benchmark]: CDTParser took 0.23 ms. Allocated memory is still 86.0 MB. Free memory was 57.1 MB in the beginning and 57.0 MB in the end (delta: 29.7 kB). There was no memory consumed. Max. memory is 16.1 GB. [2021-10-21 19:40:08,439 INFO L168 Benchmark]: CACSL2BoogieTranslator took 611.91 ms. Allocated memory is still 117.4 MB. Free memory was 82.3 MB in the beginning and 83.7 MB in the end (delta: -1.4 MB). Peak memory consumption was 10.5 MB. Max. memory is 16.1 GB. [2021-10-21 19:40:08,439 INFO L168 Benchmark]: Boogie Preprocessor took 139.87 ms. Allocated memory is still 117.4 MB. Free memory was 83.7 MB in the beginning and 80.2 MB in the end (delta: 3.5 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. [2021-10-21 19:40:08,440 INFO L168 Benchmark]: RCFGBuilder took 1148.79 ms. Allocated memory is still 117.4 MB. Free memory was 80.2 MB in the beginning and 91.7 MB in the end (delta: -11.5 MB). Peak memory consumption was 47.3 MB. Max. memory is 16.1 GB. [2021-10-21 19:40:08,440 INFO L168 Benchmark]: TraceAbstraction took 72733.10 ms. Allocated memory was 117.4 MB in the beginning and 211.8 MB in the end (delta: 94.4 MB). Free memory was 91.7 MB in the beginning and 94.6 MB in the end (delta: -2.9 MB). Peak memory consumption was 91.1 MB. Max. memory is 16.1 GB. [2021-10-21 19:40:08,441 INFO L168 Benchmark]: Witness Printer took 205.95 ms. Allocated memory is still 211.8 MB. Free memory was 94.6 MB in the beginning and 75.7 MB in the end (delta: 18.9 MB). Peak memory consumption was 18.9 MB. Max. memory is 16.1 GB. [2021-10-21 19:40:08,442 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.23 ms. Allocated memory is still 86.0 MB. Free memory was 57.1 MB in the beginning and 57.0 MB in the end (delta: 29.7 kB). There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 611.91 ms. Allocated memory is still 117.4 MB. Free memory was 82.3 MB in the beginning and 83.7 MB in the end (delta: -1.4 MB). Peak memory consumption was 10.5 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 139.87 ms. Allocated memory is still 117.4 MB. Free memory was 83.7 MB in the beginning and 80.2 MB in the end (delta: 3.5 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. * RCFGBuilder took 1148.79 ms. Allocated memory is still 117.4 MB. Free memory was 80.2 MB in the beginning and 91.7 MB in the end (delta: -11.5 MB). Peak memory consumption was 47.3 MB. Max. memory is 16.1 GB. * TraceAbstraction took 72733.10 ms. Allocated memory was 117.4 MB in the beginning and 211.8 MB in the end (delta: 94.4 MB). Free memory was 91.7 MB in the beginning and 94.6 MB in the end (delta: -2.9 MB). Peak memory consumption was 91.1 MB. Max. memory is 16.1 GB. * Witness Printer took 205.95 ms. Allocated memory is still 211.8 MB. Free memory was 94.6 MB in the beginning and 75.7 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: 72664.9ms, OverallIterations: 51, TraceHistogramMax: 2, EmptinessCheckTime: 82.9ms, AutomataDifference: 55917.1ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 18.6ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 15311 SDtfs, 21994 SDslu, 35616 SDs, 0 SdLazy, 57322 SolverSat, 7549 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 38571.1ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1520 GetRequests, 695 SyntacticMatches, 0 SemanticMatches, 825 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2856 ImplicationChecksByTransitivity, 17332.3ms 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: 877.9ms AutomataMinimizationTime, 51 MinimizatonAttempts, 2436 StatesRemovedByMinimization, 49 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 244.8ms SsaConstructionTime, 748.2ms SatisfiabilityAnalysisTime, 14233.2ms 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-10-21 19:40:08,491 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8416fbd5-b9f1-43e7-8f6b-358922e2d2bf/bin/uautomizer-j4sWxH34Be/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request...