./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 a4ecdabc Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_fd7968c7-9ac4-402c-a313-819610fc3fc4/bin/uautomizer/data/config -Xmx15G -Xms4m -jar /tmp/vcloud-vcloud-master/worker/run_dir_fd7968c7-9ac4-402c-a313-819610fc3fc4/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_fd7968c7-9ac4-402c-a313-819610fc3fc4/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_fd7968c7-9ac4-402c-a313-819610fc3fc4/bin/uautomizer/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/ntdrivers-simplified/floppy_simpl3.cil-2.c -s /tmp/vcloud-vcloud-master/worker/run_dir_fd7968c7-9ac4-402c-a313-819610fc3fc4/bin/uautomizer/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_fd7968c7-9ac4-402c-a313-819610fc3fc4/bin/uautomizer --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 9caca1067e52a4490439beb955df6129aef4eea8 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.2.0-a4ecdab [2020-11-29 22:50:05,976 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-11-29 22:50:05,979 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-11-29 22:50:06,040 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-11-29 22:50:06,042 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-11-29 22:50:06,047 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-11-29 22:50:06,051 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-11-29 22:50:06,059 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-11-29 22:50:06,062 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-11-29 22:50:06,069 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-11-29 22:50:06,070 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-11-29 22:50:06,072 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-11-29 22:50:06,073 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-11-29 22:50:06,077 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-11-29 22:50:06,078 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-11-29 22:50:06,081 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-11-29 22:50:06,083 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-11-29 22:50:06,085 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-11-29 22:50:06,091 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-11-29 22:50:06,098 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-11-29 22:50:06,100 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-11-29 22:50:06,101 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-11-29 22:50:06,102 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-11-29 22:50:06,103 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-11-29 22:50:06,106 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-11-29 22:50:06,107 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-11-29 22:50:06,107 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-11-29 22:50:06,109 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-11-29 22:50:06,109 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-11-29 22:50:06,110 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-11-29 22:50:06,111 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-11-29 22:50:06,112 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-11-29 22:50:06,113 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-11-29 22:50:06,114 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-11-29 22:50:06,115 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-11-29 22:50:06,116 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-11-29 22:50:06,116 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-11-29 22:50:06,117 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-11-29 22:50:06,117 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-11-29 22:50:06,119 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-11-29 22:50:06,119 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-11-29 22:50:06,121 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_fd7968c7-9ac4-402c-a313-819610fc3fc4/bin/uautomizer/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2020-11-29 22:50:06,147 INFO L113 SettingsManager]: Loading preferences was successful [2020-11-29 22:50:06,147 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-11-29 22:50:06,149 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-11-29 22:50:06,149 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-11-29 22:50:06,149 INFO L138 SettingsManager]: * Use SBE=true [2020-11-29 22:50:06,149 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-11-29 22:50:06,150 INFO L138 SettingsManager]: * sizeof long=4 [2020-11-29 22:50:06,150 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2020-11-29 22:50:06,150 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-11-29 22:50:06,151 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-11-29 22:50:06,151 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-11-29 22:50:06,151 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2020-11-29 22:50:06,151 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2020-11-29 22:50:06,152 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2020-11-29 22:50:06,152 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-11-29 22:50:06,152 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2020-11-29 22:50:06,152 INFO L138 SettingsManager]: * sizeof long double=12 [2020-11-29 22:50:06,153 INFO L138 SettingsManager]: * Use constant arrays=true [2020-11-29 22:50:06,153 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-11-29 22:50:06,153 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-11-29 22:50:06,154 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-11-29 22:50:06,154 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-11-29 22:50:06,154 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-11-29 22:50:06,154 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-11-29 22:50:06,155 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-11-29 22:50:06,155 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-11-29 22:50:06,155 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-11-29 22:50:06,155 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-11-29 22:50:06,156 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-vcloud-master/worker/run_dir_fd7968c7-9ac4-402c-a313-819610fc3fc4/bin/uautomizer/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-vcloud-master/worker/run_dir_fd7968c7-9ac4-402c-a313-819610fc3fc4/bin/uautomizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 9caca1067e52a4490439beb955df6129aef4eea8 [2020-11-29 22:50:06,466 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-11-29 22:50:06,504 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-11-29 22:50:06,507 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-11-29 22:50:06,509 INFO L271 PluginConnector]: Initializing CDTParser... [2020-11-29 22:50:06,518 INFO L275 PluginConnector]: CDTParser initialized [2020-11-29 22:50:06,519 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_fd7968c7-9ac4-402c-a313-819610fc3fc4/bin/uautomizer/../../sv-benchmarks/c/ntdrivers-simplified/floppy_simpl3.cil-2.c [2020-11-29 22:50:06,624 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_fd7968c7-9ac4-402c-a313-819610fc3fc4/bin/uautomizer/data/2bc31c569/124e0a1e2f4b4c4d97aff3c3c1a96ef4/FLAGe2f84b084 [2020-11-29 22:50:07,261 INFO L306 CDTParser]: Found 1 translation units. [2020-11-29 22:50:07,262 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_fd7968c7-9ac4-402c-a313-819610fc3fc4/sv-benchmarks/c/ntdrivers-simplified/floppy_simpl3.cil-2.c [2020-11-29 22:50:07,286 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_fd7968c7-9ac4-402c-a313-819610fc3fc4/bin/uautomizer/data/2bc31c569/124e0a1e2f4b4c4d97aff3c3c1a96ef4/FLAGe2f84b084 [2020-11-29 22:50:07,547 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_fd7968c7-9ac4-402c-a313-819610fc3fc4/bin/uautomizer/data/2bc31c569/124e0a1e2f4b4c4d97aff3c3c1a96ef4 [2020-11-29 22:50:07,550 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-11-29 22:50:07,553 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2020-11-29 22:50:07,557 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-11-29 22:50:07,558 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-11-29 22:50:07,562 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-11-29 22:50:07,562 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 10:50:07" (1/1) ... [2020-11-29 22:50:07,572 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@234ff8a0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 10:50:07, skipping insertion in model container [2020-11-29 22:50:07,572 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 10:50:07" (1/1) ... [2020-11-29 22:50:07,581 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-11-29 22:50:07,669 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-11-29 22:50:07,994 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-11-29 22:50:08,016 INFO L203 MainTranslator]: Completed pre-run [2020-11-29 22:50:08,150 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-11-29 22:50:08,173 INFO L208 MainTranslator]: Completed translation [2020-11-29 22:50:08,173 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 10:50:08 WrapperNode [2020-11-29 22:50:08,173 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-11-29 22:50:08,174 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-11-29 22:50:08,174 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-11-29 22:50:08,175 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-11-29 22:50:08,186 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 10:50:08" (1/1) ... [2020-11-29 22:50:08,187 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 10:50:08" (1/1) ... [2020-11-29 22:50:08,217 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 10:50:08" (1/1) ... [2020-11-29 22:50:08,218 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 10:50:08" (1/1) ... [2020-11-29 22:50:08,247 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 10:50:08" (1/1) ... [2020-11-29 22:50:08,273 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 10:50:08" (1/1) ... [2020-11-29 22:50:08,278 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 10:50:08" (1/1) ... [2020-11-29 22:50:08,301 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-11-29 22:50:08,302 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-11-29 22:50:08,302 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-11-29 22:50:08,302 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-11-29 22:50:08,312 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 10:50:08" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_fd7968c7-9ac4-402c-a313-819610fc3fc4/bin/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-11-29 22:50:08,381 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-11-29 22:50:08,381 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-11-29 22:50:08,381 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2020-11-29 22:50:08,381 INFO L138 BoogieDeclarations]: Found implementation of procedure errorFn [2020-11-29 22:50:08,382 INFO L138 BoogieDeclarations]: Found implementation of procedure _BLAST_init [2020-11-29 22:50:08,382 INFO L138 BoogieDeclarations]: Found implementation of procedure FlAcpiConfigureFloppy [2020-11-29 22:50:08,382 INFO L138 BoogieDeclarations]: Found implementation of procedure FlQueueIrpToThread [2020-11-29 22:50:08,382 INFO L138 BoogieDeclarations]: Found implementation of procedure FloppyPnp [2020-11-29 22:50:08,382 INFO L138 BoogieDeclarations]: Found implementation of procedure FloppyStartDevice [2020-11-29 22:50:08,383 INFO L138 BoogieDeclarations]: Found implementation of procedure FloppyPnpComplete [2020-11-29 22:50:08,383 INFO L138 BoogieDeclarations]: Found implementation of procedure FlFdcDeviceIo [2020-11-29 22:50:08,383 INFO L138 BoogieDeclarations]: Found implementation of procedure FloppyProcessQueuedRequests [2020-11-29 22:50:08,383 INFO L138 BoogieDeclarations]: Found implementation of procedure stub_driver_init [2020-11-29 22:50:08,384 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-11-29 22:50:08,384 INFO L138 BoogieDeclarations]: Found implementation of procedure IoBuildDeviceIoControlRequest [2020-11-29 22:50:08,384 INFO L138 BoogieDeclarations]: Found implementation of procedure IoDeleteSymbolicLink [2020-11-29 22:50:08,384 INFO L138 BoogieDeclarations]: Found implementation of procedure IoQueryDeviceDescription [2020-11-29 22:50:08,384 INFO L138 BoogieDeclarations]: Found implementation of procedure IoRegisterDeviceInterface [2020-11-29 22:50:08,385 INFO L138 BoogieDeclarations]: Found implementation of procedure IoSetDeviceInterfaceState [2020-11-29 22:50:08,385 INFO L138 BoogieDeclarations]: Found implementation of procedure stubMoreProcessingRequired [2020-11-29 22:50:08,385 INFO L138 BoogieDeclarations]: Found implementation of procedure IofCallDriver [2020-11-29 22:50:08,385 INFO L138 BoogieDeclarations]: Found implementation of procedure IofCompleteRequest [2020-11-29 22:50:08,385 INFO L138 BoogieDeclarations]: Found implementation of procedure KeSetEvent [2020-11-29 22:50:08,386 INFO L138 BoogieDeclarations]: Found implementation of procedure KeWaitForSingleObject [2020-11-29 22:50:08,386 INFO L138 BoogieDeclarations]: Found implementation of procedure ObReferenceObjectByHandle [2020-11-29 22:50:08,386 INFO L138 BoogieDeclarations]: Found implementation of procedure PsCreateSystemThread [2020-11-29 22:50:08,386 INFO L138 BoogieDeclarations]: Found implementation of procedure ZwClose [2020-11-29 22:50:08,386 INFO L138 BoogieDeclarations]: Found implementation of procedure FloppyCreateClose [2020-11-29 22:50:08,387 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2020-11-29 22:50:08,387 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2020-11-29 22:50:08,387 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2020-11-29 22:50:08,387 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-11-29 22:50:08,388 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2020-11-29 22:50:08,388 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-11-29 22:50:08,388 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_long [2020-11-29 22:50:08,388 INFO L130 BoogieDeclarations]: Found specification of procedure FlAcpiConfigureFloppy [2020-11-29 22:50:08,388 INFO L130 BoogieDeclarations]: Found specification of procedure FlQueueIrpToThread [2020-11-29 22:50:08,388 INFO L130 BoogieDeclarations]: Found specification of procedure FloppyPnp [2020-11-29 22:50:08,389 INFO L130 BoogieDeclarations]: Found specification of procedure FloppyStartDevice [2020-11-29 22:50:08,389 INFO L130 BoogieDeclarations]: Found specification of procedure FloppyPnpComplete [2020-11-29 22:50:08,389 INFO L130 BoogieDeclarations]: Found specification of procedure FlFdcDeviceIo [2020-11-29 22:50:08,389 INFO L130 BoogieDeclarations]: Found specification of procedure IoBuildDeviceIoControlRequest [2020-11-29 22:50:08,389 INFO L130 BoogieDeclarations]: Found specification of procedure IoDeleteSymbolicLink [2020-11-29 22:50:08,390 INFO L130 BoogieDeclarations]: Found specification of procedure IoQueryDeviceDescription [2020-11-29 22:50:08,390 INFO L130 BoogieDeclarations]: Found specification of procedure IoRegisterDeviceInterface [2020-11-29 22:50:08,390 INFO L130 BoogieDeclarations]: Found specification of procedure IoSetDeviceInterfaceState [2020-11-29 22:50:08,390 INFO L130 BoogieDeclarations]: Found specification of procedure IofCallDriver [2020-11-29 22:50:08,390 INFO L130 BoogieDeclarations]: Found specification of procedure KeSetEvent [2020-11-29 22:50:08,391 INFO L130 BoogieDeclarations]: Found specification of procedure KeWaitForSingleObject [2020-11-29 22:50:08,391 INFO L130 BoogieDeclarations]: Found specification of procedure ObReferenceObjectByHandle [2020-11-29 22:50:08,391 INFO L130 BoogieDeclarations]: Found specification of procedure PsCreateSystemThread [2020-11-29 22:50:08,391 INFO L130 BoogieDeclarations]: Found specification of procedure ZwClose [2020-11-29 22:50:08,392 INFO L130 BoogieDeclarations]: Found specification of procedure IofCompleteRequest [2020-11-29 22:50:08,392 INFO L130 BoogieDeclarations]: Found specification of procedure errorFn [2020-11-29 22:50:08,392 INFO L130 BoogieDeclarations]: Found specification of procedure _BLAST_init [2020-11-29 22:50:08,392 INFO L130 BoogieDeclarations]: Found specification of procedure FloppyProcessQueuedRequests [2020-11-29 22:50:08,392 INFO L130 BoogieDeclarations]: Found specification of procedure stub_driver_init [2020-11-29 22:50:08,393 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-11-29 22:50:08,393 INFO L130 BoogieDeclarations]: Found specification of procedure stubMoreProcessingRequired [2020-11-29 22:50:08,393 INFO L130 BoogieDeclarations]: Found specification of procedure FloppyCreateClose [2020-11-29 22:50:08,393 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-11-29 22:50:08,393 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-11-29 22:50:08,394 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-11-29 22:50:08,394 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-11-29 22:50:08,394 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-11-29 22:50:08,394 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-11-29 22:50:08,748 WARN L798 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2020-11-29 22:50:08,796 INFO L751 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !false; [2020-11-29 22:50:08,797 INFO L751 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume false; [2020-11-29 22:50:08,811 WARN L798 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2020-11-29 22:50:08,834 INFO L751 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !false; [2020-11-29 22:50:08,834 INFO L751 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume false; [2020-11-29 22:50:08,842 WARN L798 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2020-11-29 22:50:09,183 INFO L751 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##21: assume !false; [2020-11-29 22:50:09,183 INFO L751 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##20: assume false; [2020-11-29 22:50:09,185 WARN L798 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2020-11-29 22:50:09,308 INFO L751 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##10: assume false; [2020-11-29 22:50:09,308 INFO L751 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##11: assume !false; [2020-11-29 22:50:09,326 WARN L798 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2020-11-29 22:50:09,366 INFO L751 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##16: assume !false; [2020-11-29 22:50:09,367 INFO L751 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##15: assume false; [2020-11-29 22:50:09,508 WARN L798 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2020-11-29 22:50:09,519 INFO L751 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !false; [2020-11-29 22:50:09,519 INFO L751 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume false; [2020-11-29 22:50:09,520 WARN L798 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2020-11-29 22:50:09,533 INFO L751 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !false; [2020-11-29 22:50:09,533 INFO L751 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume false; [2020-11-29 22:50:09,534 WARN L798 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2020-11-29 22:50:09,547 INFO L751 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !false; [2020-11-29 22:50:09,548 INFO L751 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume false; [2020-11-29 22:50:09,599 WARN L798 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2020-11-29 22:50:09,642 INFO L751 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##12: assume !false; [2020-11-29 22:50:09,642 INFO L751 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##11: assume false; [2020-11-29 22:50:09,700 WARN L798 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2020-11-29 22:50:09,730 INFO L751 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !false; [2020-11-29 22:50:09,730 INFO L751 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume false; [2020-11-29 22:50:09,730 WARN L798 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2020-11-29 22:50:09,742 INFO L751 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !false; [2020-11-29 22:50:09,742 INFO L751 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume false; [2020-11-29 22:50:09,743 WARN L798 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2020-11-29 22:50:09,751 INFO L751 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !false; [2020-11-29 22:50:09,752 INFO L751 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume false; [2020-11-29 22:50:09,795 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-11-29 22:50:09,796 INFO L298 CfgBuilder]: Removed 1 assume(true) statements. [2020-11-29 22:50:09,800 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 10:50:09 BoogieIcfgContainer [2020-11-29 22:50:09,800 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-11-29 22:50:09,804 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-11-29 22:50:09,804 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-11-29 22:50:09,808 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-11-29 22:50:09,809 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.11 10:50:07" (1/3) ... [2020-11-29 22:50:09,811 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@60e8a459 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 10:50:09, skipping insertion in model container [2020-11-29 22:50:09,811 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 10:50:08" (2/3) ... [2020-11-29 22:50:09,812 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@60e8a459 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 10:50:09, skipping insertion in model container [2020-11-29 22:50:09,812 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 10:50:09" (3/3) ... [2020-11-29 22:50:09,816 INFO L111 eAbstractionObserver]: Analyzing ICFG floppy_simpl3.cil-2.c [2020-11-29 22:50:09,828 INFO L164 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-11-29 22:50:09,833 INFO L176 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2020-11-29 22:50:09,848 INFO L253 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2020-11-29 22:50:09,869 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-11-29 22:50:09,869 INFO L378 AbstractCegarLoop]: Hoare is false [2020-11-29 22:50:09,869 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-11-29 22:50:09,870 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-11-29 22:50:09,870 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-11-29 22:50:09,870 INFO L382 AbstractCegarLoop]: Difference is false [2020-11-29 22:50:09,870 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-11-29 22:50:09,870 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-11-29 22:50:09,905 INFO L276 IsEmpty]: Start isEmpty. Operand 309 states. [2020-11-29 22:50:09,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-11-29 22:50:09,915 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 22:50:09,916 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-29 22:50:09,916 INFO L429 AbstractCegarLoop]: === Iteration 1 === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr0ENSURES_VIOLATIONMEMORY_LEAK]=== [2020-11-29 22:50:09,933 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 22:50:09,933 INFO L82 PathProgramCache]: Analyzing trace with hash 1550197639, now seen corresponding path program 1 times [2020-11-29 22:50:09,944 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 22:50:09,945 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [36950201] [2020-11-29 22:50:09,945 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 22:50:10,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 22:50:10,430 WARN L193 SmtUtils]: Spent 177.00 ms on a formula simplification that was a NOOP. DAG size: 109 [2020-11-29 22:50:10,432 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-29 22:50:10,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 22:50:10,541 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-11-29 22:50:10,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 22:50:10,561 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-29 22:50:10,561 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [36950201] [2020-11-29 22:50:10,562 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-29 22:50:10,563 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-29 22:50:10,564 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [639173942] [2020-11-29 22:50:10,568 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-29 22:50:10,569 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 22:50:10,583 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-29 22:50:10,584 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-11-29 22:50:10,586 INFO L87 Difference]: Start difference. First operand 309 states. Second operand 4 states. [2020-11-29 22:50:12,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 22:50:12,301 INFO L93 Difference]: Finished difference Result 330 states and 450 transitions. [2020-11-29 22:50:12,301 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-11-29 22:50:12,302 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2020-11-29 22:50:12,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 22:50:12,339 INFO L225 Difference]: With dead ends: 330 [2020-11-29 22:50:12,339 INFO L226 Difference]: Without dead ends: 323 [2020-11-29 22:50:12,341 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-11-29 22:50:12,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 323 states. [2020-11-29 22:50:12,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 323 to 293. [2020-11-29 22:50:12,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 293 states. [2020-11-29 22:50:12,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 293 states to 293 states and 387 transitions. [2020-11-29 22:50:12,436 INFO L78 Accepts]: Start accepts. Automaton has 293 states and 387 transitions. Word has length 15 [2020-11-29 22:50:12,436 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 22:50:12,437 INFO L481 AbstractCegarLoop]: Abstraction has 293 states and 387 transitions. [2020-11-29 22:50:12,437 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-29 22:50:12,437 INFO L276 IsEmpty]: Start isEmpty. Operand 293 states and 387 transitions. [2020-11-29 22:50:12,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-11-29 22:50:12,438 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 22:50:12,439 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-29 22:50:12,439 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-11-29 22:50:12,439 INFO L429 AbstractCegarLoop]: === Iteration 2 === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr0ENSURES_VIOLATIONMEMORY_LEAK]=== [2020-11-29 22:50:12,440 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 22:50:12,440 INFO L82 PathProgramCache]: Analyzing trace with hash 134626292, now seen corresponding path program 1 times [2020-11-29 22:50:12,441 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 22:50:12,441 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [316999507] [2020-11-29 22:50:12,441 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 22:50:12,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 22:50:12,742 WARN L193 SmtUtils]: Spent 186.00 ms on a formula simplification that was a NOOP. DAG size: 109 [2020-11-29 22:50:12,743 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-29 22:50:12,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 22:50:12,835 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-11-29 22:50:12,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 22:50:12,851 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-29 22:50:12,851 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [316999507] [2020-11-29 22:50:12,852 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-29 22:50:12,852 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-11-29 22:50:12,852 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1192032439] [2020-11-29 22:50:12,853 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-11-29 22:50:12,854 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 22:50:12,854 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-11-29 22:50:12,855 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-11-29 22:50:12,855 INFO L87 Difference]: Start difference. First operand 293 states and 387 transitions. Second operand 5 states. [2020-11-29 22:50:14,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 22:50:14,381 INFO L93 Difference]: Finished difference Result 323 states and 433 transitions. [2020-11-29 22:50:14,384 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-11-29 22:50:14,384 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 21 [2020-11-29 22:50:14,385 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 22:50:14,389 INFO L225 Difference]: With dead ends: 323 [2020-11-29 22:50:14,389 INFO L226 Difference]: Without dead ends: 323 [2020-11-29 22:50:14,390 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-11-29 22:50:14,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 323 states. [2020-11-29 22:50:14,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 323 to 293. [2020-11-29 22:50:14,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 293 states. [2020-11-29 22:50:14,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 293 states to 293 states and 386 transitions. [2020-11-29 22:50:14,444 INFO L78 Accepts]: Start accepts. Automaton has 293 states and 386 transitions. Word has length 21 [2020-11-29 22:50:14,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 22:50:14,447 INFO L481 AbstractCegarLoop]: Abstraction has 293 states and 386 transitions. [2020-11-29 22:50:14,447 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-11-29 22:50:14,448 INFO L276 IsEmpty]: Start isEmpty. Operand 293 states and 386 transitions. [2020-11-29 22:50:14,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2020-11-29 22:50:14,449 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 22:50:14,449 INFO L422 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] [2020-11-29 22:50:14,450 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-11-29 22:50:14,450 INFO L429 AbstractCegarLoop]: === Iteration 3 === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr0ENSURES_VIOLATIONMEMORY_LEAK]=== [2020-11-29 22:50:14,450 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 22:50:14,451 INFO L82 PathProgramCache]: Analyzing trace with hash -1666590393, now seen corresponding path program 1 times [2020-11-29 22:50:14,451 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 22:50:14,451 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [866551565] [2020-11-29 22:50:14,451 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 22:50:14,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 22:50:14,767 WARN L193 SmtUtils]: Spent 178.00 ms on a formula simplification that was a NOOP. DAG size: 109 [2020-11-29 22:50:14,769 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-29 22:50:14,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 22:50:14,853 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-11-29 22:50:14,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 22:50:14,895 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-11-29 22:50:14,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 22:50:14,907 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-29 22:50:14,907 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [866551565] [2020-11-29 22:50:14,907 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-29 22:50:14,907 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-11-29 22:50:14,908 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [820354208] [2020-11-29 22:50:14,908 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-11-29 22:50:14,908 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 22:50:14,909 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-11-29 22:50:14,909 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-11-29 22:50:14,910 INFO L87 Difference]: Start difference. First operand 293 states and 386 transitions. Second operand 6 states. [2020-11-29 22:50:15,117 WARN L193 SmtUtils]: Spent 160.00 ms on a formula simplification that was a NOOP. DAG size: 110 [2020-11-29 22:50:17,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 22:50:17,757 INFO L93 Difference]: Finished difference Result 479 states and 638 transitions. [2020-11-29 22:50:17,758 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-11-29 22:50:17,758 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 29 [2020-11-29 22:50:17,759 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 22:50:17,764 INFO L225 Difference]: With dead ends: 479 [2020-11-29 22:50:17,764 INFO L226 Difference]: Without dead ends: 478 [2020-11-29 22:50:17,764 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2020-11-29 22:50:17,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 478 states. [2020-11-29 22:50:17,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 478 to 430. [2020-11-29 22:50:17,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 430 states. [2020-11-29 22:50:17,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 430 states to 430 states and 571 transitions. [2020-11-29 22:50:17,826 INFO L78 Accepts]: Start accepts. Automaton has 430 states and 571 transitions. Word has length 29 [2020-11-29 22:50:17,827 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 22:50:17,827 INFO L481 AbstractCegarLoop]: Abstraction has 430 states and 571 transitions. [2020-11-29 22:50:17,827 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-11-29 22:50:17,827 INFO L276 IsEmpty]: Start isEmpty. Operand 430 states and 571 transitions. [2020-11-29 22:50:17,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-11-29 22:50:17,830 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 22:50:17,834 INFO L422 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] [2020-11-29 22:50:17,834 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-11-29 22:50:17,834 INFO L429 AbstractCegarLoop]: === Iteration 4 === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr0ENSURES_VIOLATIONMEMORY_LEAK]=== [2020-11-29 22:50:17,835 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 22:50:17,835 INFO L82 PathProgramCache]: Analyzing trace with hash 1415368317, now seen corresponding path program 1 times [2020-11-29 22:50:17,836 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 22:50:17,836 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [459760162] [2020-11-29 22:50:17,836 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 22:50:17,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 22:50:18,117 WARN L193 SmtUtils]: Spent 126.00 ms on a formula simplification that was a NOOP. DAG size: 109 [2020-11-29 22:50:18,118 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-29 22:50:18,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 22:50:18,171 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-11-29 22:50:18,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 22:50:18,197 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-11-29 22:50:18,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 22:50:18,206 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-29 22:50:18,207 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [459760162] [2020-11-29 22:50:18,207 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-29 22:50:18,207 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-11-29 22:50:18,207 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1515192641] [2020-11-29 22:50:18,208 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-11-29 22:50:18,208 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 22:50:18,208 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-11-29 22:50:18,209 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-11-29 22:50:18,209 INFO L87 Difference]: Start difference. First operand 430 states and 571 transitions. Second operand 6 states. [2020-11-29 22:50:18,426 WARN L193 SmtUtils]: Spent 136.00 ms on a formula simplification that was a NOOP. DAG size: 111 [2020-11-29 22:50:20,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 22:50:20,155 INFO L93 Difference]: Finished difference Result 677 states and 902 transitions. [2020-11-29 22:50:20,156 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-11-29 22:50:20,156 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 31 [2020-11-29 22:50:20,156 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 22:50:20,163 INFO L225 Difference]: With dead ends: 677 [2020-11-29 22:50:20,163 INFO L226 Difference]: Without dead ends: 677 [2020-11-29 22:50:20,163 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2020-11-29 22:50:20,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 677 states. [2020-11-29 22:50:20,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 677 to 633. [2020-11-29 22:50:20,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 633 states. [2020-11-29 22:50:20,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 633 states to 633 states and 846 transitions. [2020-11-29 22:50:20,207 INFO L78 Accepts]: Start accepts. Automaton has 633 states and 846 transitions. Word has length 31 [2020-11-29 22:50:20,207 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 22:50:20,207 INFO L481 AbstractCegarLoop]: Abstraction has 633 states and 846 transitions. [2020-11-29 22:50:20,207 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-11-29 22:50:20,208 INFO L276 IsEmpty]: Start isEmpty. Operand 633 states and 846 transitions. [2020-11-29 22:50:20,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2020-11-29 22:50:20,210 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 22:50:20,210 INFO L422 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] [2020-11-29 22:50:20,210 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-11-29 22:50:20,210 INFO L429 AbstractCegarLoop]: === Iteration 5 === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr0ENSURES_VIOLATIONMEMORY_LEAK]=== [2020-11-29 22:50:20,211 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 22:50:20,211 INFO L82 PathProgramCache]: Analyzing trace with hash 580999791, now seen corresponding path program 1 times [2020-11-29 22:50:20,211 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 22:50:20,212 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [965713470] [2020-11-29 22:50:20,212 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 22:50:20,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 22:50:20,421 WARN L193 SmtUtils]: Spent 106.00 ms on a formula simplification that was a NOOP. DAG size: 109 [2020-11-29 22:50:20,423 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-29 22:50:20,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 22:50:20,502 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-11-29 22:50:20,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 22:50:20,533 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-11-29 22:50:20,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 22:50:20,546 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-29 22:50:20,546 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [965713470] [2020-11-29 22:50:20,546 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-29 22:50:20,547 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-11-29 22:50:20,547 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1561426292] [2020-11-29 22:50:20,548 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-11-29 22:50:20,548 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 22:50:20,549 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-11-29 22:50:20,550 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-11-29 22:50:20,550 INFO L87 Difference]: Start difference. First operand 633 states and 846 transitions. Second operand 6 states. [2020-11-29 22:50:20,736 WARN L193 SmtUtils]: Spent 150.00 ms on a formula simplification that was a NOOP. DAG size: 111 [2020-11-29 22:50:22,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 22:50:22,521 INFO L93 Difference]: Finished difference Result 723 states and 955 transitions. [2020-11-29 22:50:22,523 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-11-29 22:50:22,523 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 35 [2020-11-29 22:50:22,523 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 22:50:22,532 INFO L225 Difference]: With dead ends: 723 [2020-11-29 22:50:22,532 INFO L226 Difference]: Without dead ends: 723 [2020-11-29 22:50:22,533 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2020-11-29 22:50:22,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 723 states. [2020-11-29 22:50:22,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 723 to 671. [2020-11-29 22:50:22,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 671 states. [2020-11-29 22:50:22,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 671 states to 671 states and 895 transitions. [2020-11-29 22:50:22,590 INFO L78 Accepts]: Start accepts. Automaton has 671 states and 895 transitions. Word has length 35 [2020-11-29 22:50:22,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 22:50:22,590 INFO L481 AbstractCegarLoop]: Abstraction has 671 states and 895 transitions. [2020-11-29 22:50:22,591 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-11-29 22:50:22,591 INFO L276 IsEmpty]: Start isEmpty. Operand 671 states and 895 transitions. [2020-11-29 22:50:22,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2020-11-29 22:50:22,602 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 22:50:22,603 INFO L422 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] [2020-11-29 22:50:22,603 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-11-29 22:50:22,603 INFO L429 AbstractCegarLoop]: === Iteration 6 === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr0ENSURES_VIOLATIONMEMORY_LEAK]=== [2020-11-29 22:50:22,604 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 22:50:22,604 INFO L82 PathProgramCache]: Analyzing trace with hash -1508160872, now seen corresponding path program 1 times [2020-11-29 22:50:22,604 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 22:50:22,604 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1085065324] [2020-11-29 22:50:22,605 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 22:50:22,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 22:50:22,867 WARN L193 SmtUtils]: Spent 151.00 ms on a formula simplification that was a NOOP. DAG size: 109 [2020-11-29 22:50:22,869 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-29 22:50:22,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 22:50:22,929 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-11-29 22:50:22,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 22:50:22,960 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-11-29 22:50:22,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 22:50:22,983 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2020-11-29 22:50:22,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 22:50:23,012 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-29 22:50:23,013 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1085065324] [2020-11-29 22:50:23,014 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-29 22:50:23,015 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-11-29 22:50:23,015 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [463960794] [2020-11-29 22:50:23,015 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-11-29 22:50:23,016 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 22:50:23,016 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-11-29 22:50:23,017 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2020-11-29 22:50:23,017 INFO L87 Difference]: Start difference. First operand 671 states and 895 transitions. Second operand 9 states. [2020-11-29 22:50:24,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 22:50:24,692 INFO L93 Difference]: Finished difference Result 697 states and 925 transitions. [2020-11-29 22:50:24,692 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-11-29 22:50:24,692 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 42 [2020-11-29 22:50:24,693 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 22:50:24,697 INFO L225 Difference]: With dead ends: 697 [2020-11-29 22:50:24,697 INFO L226 Difference]: Without dead ends: 697 [2020-11-29 22:50:24,698 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2020-11-29 22:50:24,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 697 states. [2020-11-29 22:50:24,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 697 to 675. [2020-11-29 22:50:24,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 675 states. [2020-11-29 22:50:24,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 675 states to 675 states and 899 transitions. [2020-11-29 22:50:24,740 INFO L78 Accepts]: Start accepts. Automaton has 675 states and 899 transitions. Word has length 42 [2020-11-29 22:50:24,741 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 22:50:24,741 INFO L481 AbstractCegarLoop]: Abstraction has 675 states and 899 transitions. [2020-11-29 22:50:24,741 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-11-29 22:50:24,742 INFO L276 IsEmpty]: Start isEmpty. Operand 675 states and 899 transitions. [2020-11-29 22:50:24,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2020-11-29 22:50:24,745 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 22:50:24,745 INFO L422 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] [2020-11-29 22:50:24,752 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-11-29 22:50:24,753 INFO L429 AbstractCegarLoop]: === Iteration 7 === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr0ENSURES_VIOLATIONMEMORY_LEAK]=== [2020-11-29 22:50:24,753 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 22:50:24,753 INFO L82 PathProgramCache]: Analyzing trace with hash -1175482311, now seen corresponding path program 1 times [2020-11-29 22:50:24,753 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 22:50:24,754 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [405490334] [2020-11-29 22:50:24,754 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 22:50:24,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 22:50:25,019 WARN L193 SmtUtils]: Spent 150.00 ms on a formula simplification that was a NOOP. DAG size: 109 [2020-11-29 22:50:25,020 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-29 22:50:25,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 22:50:25,077 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-11-29 22:50:25,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 22:50:25,103 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-11-29 22:50:25,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 22:50:25,109 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-29 22:50:25,109 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [405490334] [2020-11-29 22:50:25,110 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-29 22:50:25,110 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-11-29 22:50:25,110 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1617711461] [2020-11-29 22:50:25,110 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-11-29 22:50:25,111 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 22:50:25,111 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-11-29 22:50:25,111 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-11-29 22:50:25,112 INFO L87 Difference]: Start difference. First operand 675 states and 899 transitions. Second operand 6 states. [2020-11-29 22:50:25,252 WARN L193 SmtUtils]: Spent 109.00 ms on a formula simplification that was a NOOP. DAG size: 110 [2020-11-29 22:50:26,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 22:50:26,850 INFO L93 Difference]: Finished difference Result 699 states and 929 transitions. [2020-11-29 22:50:26,850 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-11-29 22:50:26,850 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 41 [2020-11-29 22:50:26,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 22:50:26,855 INFO L225 Difference]: With dead ends: 699 [2020-11-29 22:50:26,855 INFO L226 Difference]: Without dead ends: 699 [2020-11-29 22:50:26,856 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2020-11-29 22:50:26,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 699 states. [2020-11-29 22:50:26,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 699 to 686. [2020-11-29 22:50:26,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 686 states. [2020-11-29 22:50:26,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 686 states to 686 states and 913 transitions. [2020-11-29 22:50:26,889 INFO L78 Accepts]: Start accepts. Automaton has 686 states and 913 transitions. Word has length 41 [2020-11-29 22:50:26,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 22:50:26,889 INFO L481 AbstractCegarLoop]: Abstraction has 686 states and 913 transitions. [2020-11-29 22:50:26,890 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-11-29 22:50:26,890 INFO L276 IsEmpty]: Start isEmpty. Operand 686 states and 913 transitions. [2020-11-29 22:50:26,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2020-11-29 22:50:26,892 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 22:50:26,892 INFO L422 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] [2020-11-29 22:50:26,892 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-11-29 22:50:26,892 INFO L429 AbstractCegarLoop]: === Iteration 8 === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr0ENSURES_VIOLATIONMEMORY_LEAK]=== [2020-11-29 22:50:26,894 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 22:50:26,894 INFO L82 PathProgramCache]: Analyzing trace with hash -590083924, now seen corresponding path program 1 times [2020-11-29 22:50:26,894 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 22:50:26,894 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [70605276] [2020-11-29 22:50:26,894 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 22:50:26,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 22:50:27,114 WARN L193 SmtUtils]: Spent 143.00 ms on a formula simplification that was a NOOP. DAG size: 109 [2020-11-29 22:50:27,115 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-29 22:50:27,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 22:50:27,163 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-11-29 22:50:27,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 22:50:27,188 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-11-29 22:50:27,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 22:50:27,222 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2020-11-29 22:50:27,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 22:50:27,249 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-11-29 22:50:27,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 22:50:27,261 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-29 22:50:27,261 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [70605276] [2020-11-29 22:50:27,262 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-29 22:50:27,262 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-11-29 22:50:27,262 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [309388512] [2020-11-29 22:50:27,264 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-11-29 22:50:27,264 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 22:50:27,265 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-11-29 22:50:27,270 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2020-11-29 22:50:27,270 INFO L87 Difference]: Start difference. First operand 686 states and 913 transitions. Second operand 8 states. [2020-11-29 22:50:27,456 WARN L193 SmtUtils]: Spent 160.00 ms on a formula simplification that was a NOOP. DAG size: 110 [2020-11-29 22:50:28,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 22:50:28,731 INFO L93 Difference]: Finished difference Result 749 states and 990 transitions. [2020-11-29 22:50:28,732 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-11-29 22:50:28,732 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 42 [2020-11-29 22:50:28,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 22:50:28,737 INFO L225 Difference]: With dead ends: 749 [2020-11-29 22:50:28,737 INFO L226 Difference]: Without dead ends: 749 [2020-11-29 22:50:28,738 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-11-29 22:50:28,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 749 states. [2020-11-29 22:50:28,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 749 to 719. [2020-11-29 22:50:28,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 719 states. [2020-11-29 22:50:28,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 719 states to 719 states and 952 transitions. [2020-11-29 22:50:28,785 INFO L78 Accepts]: Start accepts. Automaton has 719 states and 952 transitions. Word has length 42 [2020-11-29 22:50:28,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 22:50:28,787 INFO L481 AbstractCegarLoop]: Abstraction has 719 states and 952 transitions. [2020-11-29 22:50:28,788 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-11-29 22:50:28,788 INFO L276 IsEmpty]: Start isEmpty. Operand 719 states and 952 transitions. [2020-11-29 22:50:28,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2020-11-29 22:50:28,789 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 22:50:28,790 INFO L422 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] [2020-11-29 22:50:28,790 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-11-29 22:50:28,790 INFO L429 AbstractCegarLoop]: === Iteration 9 === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr0ENSURES_VIOLATIONMEMORY_LEAK]=== [2020-11-29 22:50:28,791 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 22:50:28,791 INFO L82 PathProgramCache]: Analyzing trace with hash 10295910, now seen corresponding path program 1 times [2020-11-29 22:50:28,791 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 22:50:28,792 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [399389366] [2020-11-29 22:50:28,792 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 22:50:28,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 22:50:29,007 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-29 22:50:29,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 22:50:29,069 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-11-29 22:50:29,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 22:50:29,120 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-11-29 22:50:29,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 22:50:29,155 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2020-11-29 22:50:29,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 22:50:29,225 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-11-29 22:50:29,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 22:50:29,255 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-29 22:50:29,255 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [399389366] [2020-11-29 22:50:29,256 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-29 22:50:29,256 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-11-29 22:50:29,256 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1775309195] [2020-11-29 22:50:29,256 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-11-29 22:50:29,256 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 22:50:29,257 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-11-29 22:50:29,258 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2020-11-29 22:50:29,258 INFO L87 Difference]: Start difference. First operand 719 states and 952 transitions. Second operand 12 states. [2020-11-29 22:50:29,436 WARN L193 SmtUtils]: Spent 145.00 ms on a formula simplification that was a NOOP. DAG size: 111 [2020-11-29 22:50:30,408 WARN L193 SmtUtils]: Spent 244.00 ms on a formula simplification. DAG size of input: 118 DAG size of output: 114 [2020-11-29 22:50:31,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 22:50:31,192 INFO L93 Difference]: Finished difference Result 749 states and 989 transitions. [2020-11-29 22:50:31,193 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-11-29 22:50:31,193 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 43 [2020-11-29 22:50:31,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 22:50:31,221 INFO L225 Difference]: With dead ends: 749 [2020-11-29 22:50:31,221 INFO L226 Difference]: Without dead ends: 749 [2020-11-29 22:50:31,222 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=90, Invalid=216, Unknown=0, NotChecked=0, Total=306 [2020-11-29 22:50:31,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 749 states. [2020-11-29 22:50:31,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 749 to 719. [2020-11-29 22:50:31,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 719 states. [2020-11-29 22:50:31,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 719 states to 719 states and 951 transitions. [2020-11-29 22:50:31,252 INFO L78 Accepts]: Start accepts. Automaton has 719 states and 951 transitions. Word has length 43 [2020-11-29 22:50:31,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 22:50:31,252 INFO L481 AbstractCegarLoop]: Abstraction has 719 states and 951 transitions. [2020-11-29 22:50:31,252 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-11-29 22:50:31,252 INFO L276 IsEmpty]: Start isEmpty. Operand 719 states and 951 transitions. [2020-11-29 22:50:31,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2020-11-29 22:50:31,254 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 22:50:31,254 INFO L422 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] [2020-11-29 22:50:31,254 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-11-29 22:50:31,254 INFO L429 AbstractCegarLoop]: === Iteration 10 === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr0ENSURES_VIOLATIONMEMORY_LEAK]=== [2020-11-29 22:50:31,255 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 22:50:31,255 INFO L82 PathProgramCache]: Analyzing trace with hash -583438049, now seen corresponding path program 1 times [2020-11-29 22:50:31,255 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 22:50:31,256 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [143679621] [2020-11-29 22:50:31,256 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 22:50:31,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 22:50:31,483 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-29 22:50:31,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 22:50:31,538 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-11-29 22:50:31,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 22:50:31,589 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-11-29 22:50:31,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 22:50:31,633 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2020-11-29 22:50:31,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 22:50:31,718 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-11-29 22:50:31,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 22:50:31,757 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-29 22:50:31,758 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [143679621] [2020-11-29 22:50:31,758 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-29 22:50:31,758 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-11-29 22:50:31,758 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1208373905] [2020-11-29 22:50:31,759 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-11-29 22:50:31,759 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 22:50:31,762 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-11-29 22:50:31,762 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2020-11-29 22:50:31,763 INFO L87 Difference]: Start difference. First operand 719 states and 951 transitions. Second operand 12 states. [2020-11-29 22:50:31,944 WARN L193 SmtUtils]: Spent 143.00 ms on a formula simplification that was a NOOP. DAG size: 111 [2020-11-29 22:50:33,259 WARN L193 SmtUtils]: Spent 330.00 ms on a formula simplification. DAG size of input: 118 DAG size of output: 114 [2020-11-29 22:50:34,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 22:50:34,064 INFO L93 Difference]: Finished difference Result 749 states and 988 transitions. [2020-11-29 22:50:34,065 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-11-29 22:50:34,065 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 44 [2020-11-29 22:50:34,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 22:50:34,071 INFO L225 Difference]: With dead ends: 749 [2020-11-29 22:50:34,071 INFO L226 Difference]: Without dead ends: 749 [2020-11-29 22:50:34,071 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=90, Invalid=216, Unknown=0, NotChecked=0, Total=306 [2020-11-29 22:50:34,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 749 states. [2020-11-29 22:50:34,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 749 to 719. [2020-11-29 22:50:34,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 719 states. [2020-11-29 22:50:34,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 719 states to 719 states and 950 transitions. [2020-11-29 22:50:34,102 INFO L78 Accepts]: Start accepts. Automaton has 719 states and 950 transitions. Word has length 44 [2020-11-29 22:50:34,102 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 22:50:34,102 INFO L481 AbstractCegarLoop]: Abstraction has 719 states and 950 transitions. [2020-11-29 22:50:34,102 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-11-29 22:50:34,102 INFO L276 IsEmpty]: Start isEmpty. Operand 719 states and 950 transitions. [2020-11-29 22:50:34,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2020-11-29 22:50:34,103 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 22:50:34,104 INFO L422 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] [2020-11-29 22:50:34,104 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-11-29 22:50:34,104 INFO L429 AbstractCegarLoop]: === Iteration 11 === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr0ENSURES_VIOLATIONMEMORY_LEAK]=== [2020-11-29 22:50:34,104 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 22:50:34,105 INFO L82 PathProgramCache]: Analyzing trace with hash -911563772, now seen corresponding path program 1 times [2020-11-29 22:50:34,105 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 22:50:34,105 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2039313386] [2020-11-29 22:50:34,105 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 22:50:34,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 22:50:34,293 WARN L193 SmtUtils]: Spent 107.00 ms on a formula simplification that was a NOOP. DAG size: 109 [2020-11-29 22:50:34,293 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-29 22:50:34,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 22:50:34,365 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-11-29 22:50:34,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 22:50:34,395 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-11-29 22:50:34,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 22:50:34,418 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2020-11-29 22:50:34,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 22:50:34,426 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-29 22:50:34,426 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2039313386] [2020-11-29 22:50:34,426 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-29 22:50:34,426 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-11-29 22:50:34,427 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1847627410] [2020-11-29 22:50:34,427 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-11-29 22:50:34,427 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 22:50:34,427 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-11-29 22:50:34,427 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2020-11-29 22:50:34,428 INFO L87 Difference]: Start difference. First operand 719 states and 950 transitions. Second operand 7 states. [2020-11-29 22:50:35,096 WARN L193 SmtUtils]: Spent 133.00 ms on a formula simplification that was a NOOP. DAG size: 111 [2020-11-29 22:50:36,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 22:50:36,914 INFO L93 Difference]: Finished difference Result 1092 states and 1458 transitions. [2020-11-29 22:50:36,915 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-11-29 22:50:36,915 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 45 [2020-11-29 22:50:36,915 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 22:50:36,921 INFO L225 Difference]: With dead ends: 1092 [2020-11-29 22:50:36,921 INFO L226 Difference]: Without dead ends: 1092 [2020-11-29 22:50:36,922 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2020-11-29 22:50:36,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1092 states. [2020-11-29 22:50:36,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1092 to 832. [2020-11-29 22:50:36,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 832 states. [2020-11-29 22:50:36,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 832 states to 832 states and 1104 transitions. [2020-11-29 22:50:36,954 INFO L78 Accepts]: Start accepts. Automaton has 832 states and 1104 transitions. Word has length 45 [2020-11-29 22:50:36,955 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 22:50:36,955 INFO L481 AbstractCegarLoop]: Abstraction has 832 states and 1104 transitions. [2020-11-29 22:50:36,955 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-11-29 22:50:36,955 INFO L276 IsEmpty]: Start isEmpty. Operand 832 states and 1104 transitions. [2020-11-29 22:50:36,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2020-11-29 22:50:36,957 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 22:50:36,957 INFO L422 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] [2020-11-29 22:50:36,957 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-11-29 22:50:36,957 INFO L429 AbstractCegarLoop]: === Iteration 12 === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr0ENSURES_VIOLATIONMEMORY_LEAK]=== [2020-11-29 22:50:36,958 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 22:50:36,958 INFO L82 PathProgramCache]: Analyzing trace with hash 1690062077, now seen corresponding path program 1 times [2020-11-29 22:50:36,958 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 22:50:36,958 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1153671450] [2020-11-29 22:50:36,958 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 22:50:36,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 22:50:37,141 WARN L193 SmtUtils]: Spent 110.00 ms on a formula simplification that was a NOOP. DAG size: 109 [2020-11-29 22:50:37,142 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-29 22:50:37,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 22:50:37,220 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-11-29 22:50:37,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 22:50:37,247 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-11-29 22:50:37,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 22:50:37,278 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2020-11-29 22:50:37,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 22:50:37,311 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-11-29 22:50:37,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 22:50:37,321 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-29 22:50:37,321 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1153671450] [2020-11-29 22:50:37,321 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-29 22:50:37,322 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-11-29 22:50:37,322 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2130452786] [2020-11-29 22:50:37,322 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-11-29 22:50:37,322 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 22:50:37,323 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-11-29 22:50:37,326 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2020-11-29 22:50:37,326 INFO L87 Difference]: Start difference. First operand 832 states and 1104 transitions. Second operand 10 states. [2020-11-29 22:50:38,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 22:50:38,507 INFO L93 Difference]: Finished difference Result 872 states and 1152 transitions. [2020-11-29 22:50:38,508 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-11-29 22:50:38,508 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 45 [2020-11-29 22:50:38,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 22:50:38,514 INFO L225 Difference]: With dead ends: 872 [2020-11-29 22:50:38,515 INFO L226 Difference]: Without dead ends: 857 [2020-11-29 22:50:38,519 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2020-11-29 22:50:38,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 857 states. [2020-11-29 22:50:38,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 857 to 830. [2020-11-29 22:50:38,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 830 states. [2020-11-29 22:50:38,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 830 states to 830 states and 1100 transitions. [2020-11-29 22:50:38,556 INFO L78 Accepts]: Start accepts. Automaton has 830 states and 1100 transitions. Word has length 45 [2020-11-29 22:50:38,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 22:50:38,556 INFO L481 AbstractCegarLoop]: Abstraction has 830 states and 1100 transitions. [2020-11-29 22:50:38,557 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-11-29 22:50:38,557 INFO L276 IsEmpty]: Start isEmpty. Operand 830 states and 1100 transitions. [2020-11-29 22:50:38,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2020-11-29 22:50:38,558 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 22:50:38,558 INFO L422 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] [2020-11-29 22:50:38,559 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-11-29 22:50:38,559 INFO L429 AbstractCegarLoop]: === Iteration 13 === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr0ENSURES_VIOLATIONMEMORY_LEAK]=== [2020-11-29 22:50:38,559 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 22:50:38,560 INFO L82 PathProgramCache]: Analyzing trace with hash -1271680232, now seen corresponding path program 1 times [2020-11-29 22:50:38,560 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 22:50:38,560 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1510638057] [2020-11-29 22:50:38,560 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 22:50:38,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 22:50:38,842 WARN L193 SmtUtils]: Spent 151.00 ms on a formula simplification that was a NOOP. DAG size: 109 [2020-11-29 22:50:38,843 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-29 22:50:38,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 22:50:38,904 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-11-29 22:50:38,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 22:50:38,951 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-11-29 22:50:38,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 22:50:39,020 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2020-11-29 22:50:39,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 22:50:39,034 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-29 22:50:39,035 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1510638057] [2020-11-29 22:50:39,035 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-29 22:50:39,035 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-11-29 22:50:39,035 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [370740946] [2020-11-29 22:50:39,037 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-11-29 22:50:39,037 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 22:50:39,037 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-11-29 22:50:39,038 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2020-11-29 22:50:39,039 INFO L87 Difference]: Start difference. First operand 830 states and 1100 transitions. Second operand 10 states. [2020-11-29 22:50:39,209 WARN L193 SmtUtils]: Spent 131.00 ms on a formula simplification that was a NOOP. DAG size: 117 [2020-11-29 22:50:39,482 WARN L193 SmtUtils]: Spent 209.00 ms on a formula simplification. DAG size of input: 116 DAG size of output: 114 [2020-11-29 22:50:41,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 22:50:41,244 INFO L93 Difference]: Finished difference Result 876 states and 1143 transitions. [2020-11-29 22:50:41,245 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-11-29 22:50:41,245 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 46 [2020-11-29 22:50:41,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 22:50:41,251 INFO L225 Difference]: With dead ends: 876 [2020-11-29 22:50:41,251 INFO L226 Difference]: Without dead ends: 876 [2020-11-29 22:50:41,252 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=84, Invalid=188, Unknown=0, NotChecked=0, Total=272 [2020-11-29 22:50:41,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 876 states. [2020-11-29 22:50:41,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 876 to 821. [2020-11-29 22:50:41,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 821 states. [2020-11-29 22:50:41,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 821 states to 821 states and 1079 transitions. [2020-11-29 22:50:41,287 INFO L78 Accepts]: Start accepts. Automaton has 821 states and 1079 transitions. Word has length 46 [2020-11-29 22:50:41,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 22:50:41,288 INFO L481 AbstractCegarLoop]: Abstraction has 821 states and 1079 transitions. [2020-11-29 22:50:41,288 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-11-29 22:50:41,288 INFO L276 IsEmpty]: Start isEmpty. Operand 821 states and 1079 transitions. [2020-11-29 22:50:41,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2020-11-29 22:50:41,290 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 22:50:41,290 INFO L422 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] [2020-11-29 22:50:41,290 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-11-29 22:50:41,291 INFO L429 AbstractCegarLoop]: === Iteration 14 === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr0ENSURES_VIOLATIONMEMORY_LEAK]=== [2020-11-29 22:50:41,291 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 22:50:41,291 INFO L82 PathProgramCache]: Analyzing trace with hash 1818203795, now seen corresponding path program 1 times [2020-11-29 22:50:41,291 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 22:50:41,292 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1723138235] [2020-11-29 22:50:41,292 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 22:50:41,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 22:50:41,482 WARN L193 SmtUtils]: Spent 125.00 ms on a formula simplification that was a NOOP. DAG size: 109 [2020-11-29 22:50:41,482 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-29 22:50:41,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 22:50:41,545 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-11-29 22:50:41,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 22:50:41,596 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-11-29 22:50:41,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 22:50:41,624 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2020-11-29 22:50:41,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 22:50:41,684 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-29 22:50:41,686 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1723138235] [2020-11-29 22:50:41,686 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-29 22:50:41,686 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-11-29 22:50:41,687 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1635832439] [2020-11-29 22:50:41,687 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-11-29 22:50:41,687 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 22:50:41,688 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-11-29 22:50:41,688 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2020-11-29 22:50:41,688 INFO L87 Difference]: Start difference. First operand 821 states and 1079 transitions. Second operand 8 states. [2020-11-29 22:50:41,831 WARN L193 SmtUtils]: Spent 111.00 ms on a formula simplification that was a NOOP. DAG size: 111 [2020-11-29 22:50:43,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 22:50:43,916 INFO L93 Difference]: Finished difference Result 582 states and 732 transitions. [2020-11-29 22:50:43,916 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-11-29 22:50:43,917 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 50 [2020-11-29 22:50:43,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 22:50:43,920 INFO L225 Difference]: With dead ends: 582 [2020-11-29 22:50:43,920 INFO L226 Difference]: Without dead ends: 582 [2020-11-29 22:50:43,921 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=51, Invalid=105, Unknown=0, NotChecked=0, Total=156 [2020-11-29 22:50:43,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 582 states. [2020-11-29 22:50:43,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 582 to 529. [2020-11-29 22:50:43,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 529 states. [2020-11-29 22:50:43,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 529 states to 529 states and 668 transitions. [2020-11-29 22:50:43,941 INFO L78 Accepts]: Start accepts. Automaton has 529 states and 668 transitions. Word has length 50 [2020-11-29 22:50:43,941 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 22:50:43,941 INFO L481 AbstractCegarLoop]: Abstraction has 529 states and 668 transitions. [2020-11-29 22:50:43,941 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-11-29 22:50:43,942 INFO L276 IsEmpty]: Start isEmpty. Operand 529 states and 668 transitions. [2020-11-29 22:50:43,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2020-11-29 22:50:43,943 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 22:50:43,944 INFO L422 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] [2020-11-29 22:50:43,944 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-11-29 22:50:43,944 INFO L429 AbstractCegarLoop]: === Iteration 15 === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr0ENSURES_VIOLATIONMEMORY_LEAK]=== [2020-11-29 22:50:43,944 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 22:50:43,945 INFO L82 PathProgramCache]: Analyzing trace with hash 1987810337, now seen corresponding path program 1 times [2020-11-29 22:50:43,945 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 22:50:43,945 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [212812350] [2020-11-29 22:50:43,945 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 22:50:43,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 22:50:44,199 WARN L193 SmtUtils]: Spent 182.00 ms on a formula simplification that was a NOOP. DAG size: 109 [2020-11-29 22:50:44,200 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-29 22:50:44,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 22:50:44,254 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-11-29 22:50:44,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 22:50:44,281 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-11-29 22:50:44,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 22:50:44,296 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2020-11-29 22:50:44,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 22:50:44,299 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-11-29 22:50:44,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 22:50:44,314 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2020-11-29 22:50:44,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 22:50:44,324 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-29 22:50:44,324 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [212812350] [2020-11-29 22:50:44,324 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-29 22:50:44,324 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-11-29 22:50:44,325 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [395699018] [2020-11-29 22:50:44,325 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-11-29 22:50:44,325 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 22:50:44,326 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-11-29 22:50:44,326 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2020-11-29 22:50:44,326 INFO L87 Difference]: Start difference. First operand 529 states and 668 transitions. Second operand 8 states. [2020-11-29 22:50:44,510 WARN L193 SmtUtils]: Spent 156.00 ms on a formula simplification that was a NOOP. DAG size: 110 [2020-11-29 22:50:45,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 22:50:45,405 INFO L93 Difference]: Finished difference Result 570 states and 721 transitions. [2020-11-29 22:50:45,406 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-11-29 22:50:45,406 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 56 [2020-11-29 22:50:45,406 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 22:50:45,410 INFO L225 Difference]: With dead ends: 570 [2020-11-29 22:50:45,410 INFO L226 Difference]: Without dead ends: 570 [2020-11-29 22:50:45,410 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=84, Unknown=0, NotChecked=0, Total=132 [2020-11-29 22:50:45,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 570 states. [2020-11-29 22:50:45,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 570 to 543. [2020-11-29 22:50:45,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 543 states. [2020-11-29 22:50:45,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 543 states to 543 states and 688 transitions. [2020-11-29 22:50:45,430 INFO L78 Accepts]: Start accepts. Automaton has 543 states and 688 transitions. Word has length 56 [2020-11-29 22:50:45,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 22:50:45,431 INFO L481 AbstractCegarLoop]: Abstraction has 543 states and 688 transitions. [2020-11-29 22:50:45,431 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-11-29 22:50:45,431 INFO L276 IsEmpty]: Start isEmpty. Operand 543 states and 688 transitions. [2020-11-29 22:50:45,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2020-11-29 22:50:45,433 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 22:50:45,433 INFO L422 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] [2020-11-29 22:50:45,433 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2020-11-29 22:50:45,433 INFO L429 AbstractCegarLoop]: === Iteration 16 === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr0ENSURES_VIOLATIONMEMORY_LEAK]=== [2020-11-29 22:50:45,434 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 22:50:45,434 INFO L82 PathProgramCache]: Analyzing trace with hash -30582031, now seen corresponding path program 1 times [2020-11-29 22:50:45,434 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 22:50:45,434 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [977633528] [2020-11-29 22:50:45,435 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 22:50:45,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 22:50:45,655 WARN L193 SmtUtils]: Spent 145.00 ms on a formula simplification that was a NOOP. DAG size: 109 [2020-11-29 22:50:45,656 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-29 22:50:45,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 22:50:45,709 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-11-29 22:50:45,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 22:50:45,735 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-11-29 22:50:45,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 22:50:45,762 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2020-11-29 22:50:45,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 22:50:45,851 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-11-29 22:50:45,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 22:50:45,901 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-29 22:50:45,901 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [977633528] [2020-11-29 22:50:45,903 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-29 22:50:45,903 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-11-29 22:50:45,903 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1947771282] [2020-11-29 22:50:45,904 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-11-29 22:50:45,904 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 22:50:45,904 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-11-29 22:50:45,905 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2020-11-29 22:50:45,905 INFO L87 Difference]: Start difference. First operand 543 states and 688 transitions. Second operand 12 states. [2020-11-29 22:50:46,111 WARN L193 SmtUtils]: Spent 141.00 ms on a formula simplification that was a NOOP. DAG size: 115 [2020-11-29 22:50:46,286 WARN L193 SmtUtils]: Spent 136.00 ms on a formula simplification that was a NOOP. DAG size: 113 [2020-11-29 22:50:46,616 WARN L193 SmtUtils]: Spent 142.00 ms on a formula simplification that was a NOOP. DAG size: 114 [2020-11-29 22:50:47,074 WARN L193 SmtUtils]: Spent 304.00 ms on a formula simplification. DAG size of input: 116 DAG size of output: 114 [2020-11-29 22:50:48,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 22:50:48,629 INFO L93 Difference]: Finished difference Result 715 states and 904 transitions. [2020-11-29 22:50:48,630 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2020-11-29 22:50:48,630 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 53 [2020-11-29 22:50:48,630 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 22:50:48,632 INFO L225 Difference]: With dead ends: 715 [2020-11-29 22:50:48,633 INFO L226 Difference]: Without dead ends: 715 [2020-11-29 22:50:48,633 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 121 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=160, Invalid=490, Unknown=0, NotChecked=0, Total=650 [2020-11-29 22:50:48,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 715 states. [2020-11-29 22:50:48,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 715 to 572. [2020-11-29 22:50:48,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 572 states. [2020-11-29 22:50:48,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 572 states to 572 states and 721 transitions. [2020-11-29 22:50:48,651 INFO L78 Accepts]: Start accepts. Automaton has 572 states and 721 transitions. Word has length 53 [2020-11-29 22:50:48,652 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 22:50:48,652 INFO L481 AbstractCegarLoop]: Abstraction has 572 states and 721 transitions. [2020-11-29 22:50:48,652 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-11-29 22:50:48,652 INFO L276 IsEmpty]: Start isEmpty. Operand 572 states and 721 transitions. [2020-11-29 22:50:48,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2020-11-29 22:50:48,653 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 22:50:48,654 INFO L422 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] [2020-11-29 22:50:48,654 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2020-11-29 22:50:48,654 INFO L429 AbstractCegarLoop]: === Iteration 17 === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr0ENSURES_VIOLATIONMEMORY_LEAK]=== [2020-11-29 22:50:48,654 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 22:50:48,654 INFO L82 PathProgramCache]: Analyzing trace with hash 744999212, now seen corresponding path program 1 times [2020-11-29 22:50:48,655 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 22:50:48,655 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1772589397] [2020-11-29 22:50:48,655 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 22:50:48,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 22:50:48,814 WARN L193 SmtUtils]: Spent 123.00 ms on a formula simplification that was a NOOP. DAG size: 109 [2020-11-29 22:50:48,815 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-29 22:50:48,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 22:50:48,874 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-11-29 22:50:48,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 22:50:48,922 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-11-29 22:50:48,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 22:50:48,973 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2020-11-29 22:50:48,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 22:50:49,002 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-11-29 22:50:49,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 22:50:49,024 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-29 22:50:49,024 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1772589397] [2020-11-29 22:50:49,024 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-29 22:50:49,024 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-11-29 22:50:49,025 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1865356233] [2020-11-29 22:50:49,025 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-11-29 22:50:49,025 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 22:50:49,026 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-11-29 22:50:49,026 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2020-11-29 22:50:49,026 INFO L87 Difference]: Start difference. First operand 572 states and 721 transitions. Second operand 8 states. [2020-11-29 22:50:49,466 WARN L193 SmtUtils]: Spent 134.00 ms on a formula simplification that was a NOOP. DAG size: 112 [2020-11-29 22:50:49,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 22:50:49,935 INFO L93 Difference]: Finished difference Result 639 states and 812 transitions. [2020-11-29 22:50:49,936 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-11-29 22:50:49,936 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 55 [2020-11-29 22:50:49,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 22:50:49,939 INFO L225 Difference]: With dead ends: 639 [2020-11-29 22:50:49,939 INFO L226 Difference]: Without dead ends: 639 [2020-11-29 22:50:49,939 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-11-29 22:50:49,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 639 states. [2020-11-29 22:50:49,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 639 to 584. [2020-11-29 22:50:49,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 584 states. [2020-11-29 22:50:49,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 584 states to 584 states and 738 transitions. [2020-11-29 22:50:49,956 INFO L78 Accepts]: Start accepts. Automaton has 584 states and 738 transitions. Word has length 55 [2020-11-29 22:50:49,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 22:50:49,956 INFO L481 AbstractCegarLoop]: Abstraction has 584 states and 738 transitions. [2020-11-29 22:50:49,956 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-11-29 22:50:49,956 INFO L276 IsEmpty]: Start isEmpty. Operand 584 states and 738 transitions. [2020-11-29 22:50:49,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2020-11-29 22:50:49,958 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 22:50:49,958 INFO L422 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] [2020-11-29 22:50:49,958 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2020-11-29 22:50:49,958 INFO L429 AbstractCegarLoop]: === Iteration 18 === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr0ENSURES_VIOLATIONMEMORY_LEAK]=== [2020-11-29 22:50:49,959 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 22:50:49,959 INFO L82 PathProgramCache]: Analyzing trace with hash -1249145494, now seen corresponding path program 1 times [2020-11-29 22:50:49,959 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 22:50:49,959 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1733472417] [2020-11-29 22:50:49,959 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 22:50:49,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 22:50:50,137 WARN L193 SmtUtils]: Spent 137.00 ms on a formula simplification that was a NOOP. DAG size: 109 [2020-11-29 22:50:50,137 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-29 22:50:50,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 22:50:50,189 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-11-29 22:50:50,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 22:50:50,216 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-11-29 22:50:50,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 22:50:50,254 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2020-11-29 22:50:50,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 22:50:50,342 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-11-29 22:50:50,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 22:50:50,389 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-29 22:50:50,389 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1733472417] [2020-11-29 22:50:50,390 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-29 22:50:50,390 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-11-29 22:50:50,390 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [857846380] [2020-11-29 22:50:50,392 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-11-29 22:50:50,392 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 22:50:50,392 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-11-29 22:50:50,392 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2020-11-29 22:50:50,393 INFO L87 Difference]: Start difference. First operand 584 states and 738 transitions. Second operand 12 states. [2020-11-29 22:50:50,670 WARN L193 SmtUtils]: Spent 227.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 111 [2020-11-29 22:50:50,823 WARN L193 SmtUtils]: Spent 110.00 ms on a formula simplification that was a NOOP. DAG size: 112 [2020-11-29 22:50:52,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 22:50:52,476 INFO L93 Difference]: Finished difference Result 612 states and 770 transitions. [2020-11-29 22:50:52,477 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2020-11-29 22:50:52,477 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 55 [2020-11-29 22:50:52,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 22:50:52,479 INFO L225 Difference]: With dead ends: 612 [2020-11-29 22:50:52,479 INFO L226 Difference]: Without dead ends: 612 [2020-11-29 22:50:52,479 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=112, Invalid=350, Unknown=0, NotChecked=0, Total=462 [2020-11-29 22:50:52,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 612 states. [2020-11-29 22:50:52,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 612 to 565. [2020-11-29 22:50:52,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 565 states. [2020-11-29 22:50:52,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 565 states to 565 states and 712 transitions. [2020-11-29 22:50:52,495 INFO L78 Accepts]: Start accepts. Automaton has 565 states and 712 transitions. Word has length 55 [2020-11-29 22:50:52,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 22:50:52,496 INFO L481 AbstractCegarLoop]: Abstraction has 565 states and 712 transitions. [2020-11-29 22:50:52,496 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-11-29 22:50:52,496 INFO L276 IsEmpty]: Start isEmpty. Operand 565 states and 712 transitions. [2020-11-29 22:50:52,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2020-11-29 22:50:52,497 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 22:50:52,498 INFO L422 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] [2020-11-29 22:50:52,498 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2020-11-29 22:50:52,498 INFO L429 AbstractCegarLoop]: === Iteration 19 === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr0ENSURES_VIOLATIONMEMORY_LEAK]=== [2020-11-29 22:50:52,498 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 22:50:52,498 INFO L82 PathProgramCache]: Analyzing trace with hash -1102452692, now seen corresponding path program 1 times [2020-11-29 22:50:52,499 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 22:50:52,499 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [477312030] [2020-11-29 22:50:52,499 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 22:50:52,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 22:50:52,677 WARN L193 SmtUtils]: Spent 122.00 ms on a formula simplification that was a NOOP. DAG size: 109 [2020-11-29 22:50:52,678 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-29 22:50:52,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 22:50:52,746 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-11-29 22:50:52,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 22:50:52,765 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-11-29 22:50:52,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 22:50:52,803 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2020-11-29 22:50:52,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 22:50:52,833 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-11-29 22:50:52,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 22:50:52,844 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-29 22:50:52,844 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [477312030] [2020-11-29 22:50:52,845 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-29 22:50:52,845 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-11-29 22:50:52,845 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [23384557] [2020-11-29 22:50:52,845 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-11-29 22:50:52,846 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 22:50:52,846 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-11-29 22:50:52,846 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2020-11-29 22:50:52,846 INFO L87 Difference]: Start difference. First operand 565 states and 712 transitions. Second operand 8 states. [2020-11-29 22:50:52,987 WARN L193 SmtUtils]: Spent 119.00 ms on a formula simplification that was a NOOP. DAG size: 110 [2020-11-29 22:50:53,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 22:50:53,715 INFO L93 Difference]: Finished difference Result 668 states and 842 transitions. [2020-11-29 22:50:53,716 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-11-29 22:50:53,716 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 55 [2020-11-29 22:50:53,716 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 22:50:53,718 INFO L225 Difference]: With dead ends: 668 [2020-11-29 22:50:53,718 INFO L226 Difference]: Without dead ends: 668 [2020-11-29 22:50:53,719 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-11-29 22:50:53,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 668 states. [2020-11-29 22:50:53,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 668 to 581. [2020-11-29 22:50:53,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 581 states. [2020-11-29 22:50:53,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 581 states to 581 states and 734 transitions. [2020-11-29 22:50:53,736 INFO L78 Accepts]: Start accepts. Automaton has 581 states and 734 transitions. Word has length 55 [2020-11-29 22:50:53,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 22:50:53,736 INFO L481 AbstractCegarLoop]: Abstraction has 581 states and 734 transitions. [2020-11-29 22:50:53,736 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-11-29 22:50:53,736 INFO L276 IsEmpty]: Start isEmpty. Operand 581 states and 734 transitions. [2020-11-29 22:50:53,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2020-11-29 22:50:53,738 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 22:50:53,738 INFO L422 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] [2020-11-29 22:50:53,738 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2020-11-29 22:50:53,738 INFO L429 AbstractCegarLoop]: === Iteration 20 === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr0ENSURES_VIOLATIONMEMORY_LEAK]=== [2020-11-29 22:50:53,739 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 22:50:53,739 INFO L82 PathProgramCache]: Analyzing trace with hash -1872511654, now seen corresponding path program 1 times [2020-11-29 22:50:53,739 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 22:50:53,739 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2028880522] [2020-11-29 22:50:53,739 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 22:50:53,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 22:50:53,926 WARN L193 SmtUtils]: Spent 131.00 ms on a formula simplification that was a NOOP. DAG size: 109 [2020-11-29 22:50:53,927 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-29 22:50:53,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 22:50:53,982 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-11-29 22:50:53,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 22:50:54,003 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-11-29 22:50:54,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 22:50:54,021 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2020-11-29 22:50:54,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 22:50:54,128 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-29 22:50:54,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 22:50:54,160 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-11-29 22:50:54,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 22:50:54,171 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-29 22:50:54,171 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2028880522] [2020-11-29 22:50:54,171 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-29 22:50:54,172 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-11-29 22:50:54,172 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1387106620] [2020-11-29 22:50:54,172 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-11-29 22:50:54,172 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 22:50:54,173 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-11-29 22:50:54,173 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2020-11-29 22:50:54,173 INFO L87 Difference]: Start difference. First operand 581 states and 734 transitions. Second operand 10 states. [2020-11-29 22:50:55,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 22:50:55,688 INFO L93 Difference]: Finished difference Result 545 states and 677 transitions. [2020-11-29 22:50:55,688 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-11-29 22:50:55,688 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 62 [2020-11-29 22:50:55,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 22:50:55,690 INFO L225 Difference]: With dead ends: 545 [2020-11-29 22:50:55,691 INFO L226 Difference]: Without dead ends: 545 [2020-11-29 22:50:55,691 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2020-11-29 22:50:55,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 545 states. [2020-11-29 22:50:55,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 545 to 507. [2020-11-29 22:50:55,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 507 states. [2020-11-29 22:50:55,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 507 states to 507 states and 628 transitions. [2020-11-29 22:50:55,705 INFO L78 Accepts]: Start accepts. Automaton has 507 states and 628 transitions. Word has length 62 [2020-11-29 22:50:55,706 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 22:50:55,706 INFO L481 AbstractCegarLoop]: Abstraction has 507 states and 628 transitions. [2020-11-29 22:50:55,706 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-11-29 22:50:55,706 INFO L276 IsEmpty]: Start isEmpty. Operand 507 states and 628 transitions. [2020-11-29 22:50:55,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2020-11-29 22:50:55,707 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 22:50:55,708 INFO L422 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] [2020-11-29 22:50:55,708 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2020-11-29 22:50:55,708 INFO L429 AbstractCegarLoop]: === Iteration 21 === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr0ENSURES_VIOLATIONMEMORY_LEAK]=== [2020-11-29 22:50:55,708 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 22:50:55,709 INFO L82 PathProgramCache]: Analyzing trace with hash 1306733286, now seen corresponding path program 1 times [2020-11-29 22:50:55,709 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 22:50:55,709 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [488303076] [2020-11-29 22:50:55,709 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 22:50:55,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 22:50:55,903 WARN L193 SmtUtils]: Spent 129.00 ms on a formula simplification that was a NOOP. DAG size: 109 [2020-11-29 22:50:55,904 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-29 22:50:55,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 22:50:55,959 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-11-29 22:50:55,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 22:50:55,984 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-11-29 22:50:55,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 22:50:56,014 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2020-11-29 22:50:56,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 22:50:56,069 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-11-29 22:50:56,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 22:50:56,119 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-29 22:50:56,120 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [488303076] [2020-11-29 22:50:56,120 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-29 22:50:56,120 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2020-11-29 22:50:56,120 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [652519567] [2020-11-29 22:50:56,121 INFO L461 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-11-29 22:50:56,121 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 22:50:56,121 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-11-29 22:50:56,122 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2020-11-29 22:50:56,122 INFO L87 Difference]: Start difference. First operand 507 states and 628 transitions. Second operand 13 states. [2020-11-29 22:50:57,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 22:50:57,662 INFO L93 Difference]: Finished difference Result 569 states and 709 transitions. [2020-11-29 22:50:57,663 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-11-29 22:50:57,663 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 56 [2020-11-29 22:50:57,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 22:50:57,665 INFO L225 Difference]: With dead ends: 569 [2020-11-29 22:50:57,665 INFO L226 Difference]: Without dead ends: 568 [2020-11-29 22:50:57,665 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=192, Unknown=0, NotChecked=0, Total=240 [2020-11-29 22:50:57,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 568 states. [2020-11-29 22:50:57,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 568 to 524. [2020-11-29 22:50:57,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 524 states. [2020-11-29 22:50:57,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 524 states to 524 states and 650 transitions. [2020-11-29 22:50:57,678 INFO L78 Accepts]: Start accepts. Automaton has 524 states and 650 transitions. Word has length 56 [2020-11-29 22:50:57,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 22:50:57,679 INFO L481 AbstractCegarLoop]: Abstraction has 524 states and 650 transitions. [2020-11-29 22:50:57,679 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-11-29 22:50:57,679 INFO L276 IsEmpty]: Start isEmpty. Operand 524 states and 650 transitions. [2020-11-29 22:50:57,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2020-11-29 22:50:57,681 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 22:50:57,681 INFO L422 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] [2020-11-29 22:50:57,681 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2020-11-29 22:50:57,681 INFO L429 AbstractCegarLoop]: === Iteration 22 === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr0ENSURES_VIOLATIONMEMORY_LEAK]=== [2020-11-29 22:50:57,682 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 22:50:57,682 INFO L82 PathProgramCache]: Analyzing trace with hash 1315315016, now seen corresponding path program 1 times [2020-11-29 22:50:57,682 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 22:50:57,682 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [153756362] [2020-11-29 22:50:57,682 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 22:50:57,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 22:50:57,871 WARN L193 SmtUtils]: Spent 127.00 ms on a formula simplification that was a NOOP. DAG size: 109 [2020-11-29 22:50:57,871 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-29 22:50:57,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 22:50:57,947 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-11-29 22:50:57,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 22:50:57,979 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-11-29 22:50:57,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 22:50:58,014 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2020-11-29 22:50:58,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 22:50:58,091 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-11-29 22:50:58,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 22:50:58,129 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-29 22:50:58,129 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [153756362] [2020-11-29 22:50:58,130 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-29 22:50:58,130 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2020-11-29 22:50:58,130 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [893373985] [2020-11-29 22:50:58,130 INFO L461 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-11-29 22:50:58,130 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 22:50:58,131 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-11-29 22:50:58,131 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2020-11-29 22:50:58,131 INFO L87 Difference]: Start difference. First operand 524 states and 650 transitions. Second operand 13 states. [2020-11-29 22:50:59,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 22:50:59,707 INFO L93 Difference]: Finished difference Result 564 states and 697 transitions. [2020-11-29 22:50:59,709 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-11-29 22:50:59,709 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 56 [2020-11-29 22:50:59,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 22:50:59,712 INFO L225 Difference]: With dead ends: 564 [2020-11-29 22:50:59,712 INFO L226 Difference]: Without dead ends: 552 [2020-11-29 22:50:59,712 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2020-11-29 22:50:59,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 552 states. [2020-11-29 22:50:59,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 552 to 521. [2020-11-29 22:50:59,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 521 states. [2020-11-29 22:50:59,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 521 states to 521 states and 646 transitions. [2020-11-29 22:50:59,727 INFO L78 Accepts]: Start accepts. Automaton has 521 states and 646 transitions. Word has length 56 [2020-11-29 22:50:59,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 22:50:59,727 INFO L481 AbstractCegarLoop]: Abstraction has 521 states and 646 transitions. [2020-11-29 22:50:59,727 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-11-29 22:50:59,728 INFO L276 IsEmpty]: Start isEmpty. Operand 521 states and 646 transitions. [2020-11-29 22:50:59,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2020-11-29 22:50:59,729 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 22:50:59,729 INFO L422 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] [2020-11-29 22:50:59,729 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2020-11-29 22:50:59,729 INFO L429 AbstractCegarLoop]: === Iteration 23 === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr0ENSURES_VIOLATIONMEMORY_LEAK]=== [2020-11-29 22:50:59,730 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 22:50:59,730 INFO L82 PathProgramCache]: Analyzing trace with hash -1319760962, now seen corresponding path program 1 times [2020-11-29 22:50:59,730 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 22:50:59,730 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1165976139] [2020-11-29 22:50:59,730 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 22:50:59,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 22:50:59,881 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-29 22:50:59,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 22:50:59,958 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-11-29 22:50:59,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 22:50:59,986 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-11-29 22:50:59,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 22:51:00,019 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2020-11-29 22:51:00,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 22:51:00,087 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2020-11-29 22:51:00,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 22:51:00,111 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2020-11-29 22:51:00,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 22:51:00,137 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-29 22:51:00,137 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1165976139] [2020-11-29 22:51:00,138 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-29 22:51:00,138 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-11-29 22:51:00,139 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [278001793] [2020-11-29 22:51:00,139 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-11-29 22:51:00,140 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 22:51:00,140 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-11-29 22:51:00,140 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2020-11-29 22:51:00,140 INFO L87 Difference]: Start difference. First operand 521 states and 646 transitions. Second operand 12 states. [2020-11-29 22:51:01,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 22:51:01,413 INFO L93 Difference]: Finished difference Result 564 states and 696 transitions. [2020-11-29 22:51:01,414 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-11-29 22:51:01,414 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 58 [2020-11-29 22:51:01,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 22:51:01,416 INFO L225 Difference]: With dead ends: 564 [2020-11-29 22:51:01,416 INFO L226 Difference]: Without dead ends: 524 [2020-11-29 22:51:01,416 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=53, Invalid=187, Unknown=0, NotChecked=0, Total=240 [2020-11-29 22:51:01,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 524 states. [2020-11-29 22:51:01,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 524 to 497. [2020-11-29 22:51:01,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 497 states. [2020-11-29 22:51:01,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 497 states to 497 states and 616 transitions. [2020-11-29 22:51:01,436 INFO L78 Accepts]: Start accepts. Automaton has 497 states and 616 transitions. Word has length 58 [2020-11-29 22:51:01,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 22:51:01,437 INFO L481 AbstractCegarLoop]: Abstraction has 497 states and 616 transitions. [2020-11-29 22:51:01,437 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-11-29 22:51:01,437 INFO L276 IsEmpty]: Start isEmpty. Operand 497 states and 616 transitions. [2020-11-29 22:51:01,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2020-11-29 22:51:01,438 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 22:51:01,438 INFO L422 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] [2020-11-29 22:51:01,439 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2020-11-29 22:51:01,439 INFO L429 AbstractCegarLoop]: === Iteration 24 === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr0ENSURES_VIOLATIONMEMORY_LEAK]=== [2020-11-29 22:51:01,439 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 22:51:01,440 INFO L82 PathProgramCache]: Analyzing trace with hash -1334972887, now seen corresponding path program 1 times [2020-11-29 22:51:01,440 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 22:51:01,440 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [638978429] [2020-11-29 22:51:01,440 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 22:51:01,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 22:51:01,642 WARN L193 SmtUtils]: Spent 119.00 ms on a formula simplification that was a NOOP. DAG size: 109 [2020-11-29 22:51:01,643 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-29 22:51:01,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 22:51:01,692 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-11-29 22:51:01,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 22:51:01,720 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-11-29 22:51:01,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 22:51:01,749 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2020-11-29 22:51:01,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 22:51:01,791 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-11-29 22:51:01,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 22:51:01,805 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-29 22:51:01,805 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [638978429] [2020-11-29 22:51:01,805 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-29 22:51:01,805 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-11-29 22:51:01,805 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1939070646] [2020-11-29 22:51:01,806 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-11-29 22:51:01,806 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 22:51:01,806 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-11-29 22:51:01,806 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2020-11-29 22:51:01,807 INFO L87 Difference]: Start difference. First operand 497 states and 616 transitions. Second operand 10 states. [2020-11-29 22:51:01,964 WARN L193 SmtUtils]: Spent 123.00 ms on a formula simplification that was a NOOP. DAG size: 110 [2020-11-29 22:51:03,289 WARN L193 SmtUtils]: Spent 211.00 ms on a formula simplification. DAG size of input: 116 DAG size of output: 114 [2020-11-29 22:51:03,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 22:51:03,639 INFO L93 Difference]: Finished difference Result 529 states and 652 transitions. [2020-11-29 22:51:03,639 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-11-29 22:51:03,639 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 57 [2020-11-29 22:51:03,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 22:51:03,642 INFO L225 Difference]: With dead ends: 529 [2020-11-29 22:51:03,642 INFO L226 Difference]: Without dead ends: 515 [2020-11-29 22:51:03,642 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 10 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=81, Invalid=191, Unknown=0, NotChecked=0, Total=272 [2020-11-29 22:51:03,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 515 states. [2020-11-29 22:51:03,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 515 to 479. [2020-11-29 22:51:03,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 479 states. [2020-11-29 22:51:03,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 479 states to 479 states and 591 transitions. [2020-11-29 22:51:03,651 INFO L78 Accepts]: Start accepts. Automaton has 479 states and 591 transitions. Word has length 57 [2020-11-29 22:51:03,651 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 22:51:03,651 INFO L481 AbstractCegarLoop]: Abstraction has 479 states and 591 transitions. [2020-11-29 22:51:03,651 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-11-29 22:51:03,652 INFO L276 IsEmpty]: Start isEmpty. Operand 479 states and 591 transitions. [2020-11-29 22:51:03,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2020-11-29 22:51:03,653 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 22:51:03,653 INFO L422 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] [2020-11-29 22:51:03,653 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2020-11-29 22:51:03,653 INFO L429 AbstractCegarLoop]: === Iteration 25 === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr0ENSURES_VIOLATIONMEMORY_LEAK]=== [2020-11-29 22:51:03,654 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 22:51:03,654 INFO L82 PathProgramCache]: Analyzing trace with hash 1532555091, now seen corresponding path program 1 times [2020-11-29 22:51:03,654 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 22:51:03,654 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1744699091] [2020-11-29 22:51:03,654 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 22:51:03,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 22:51:03,833 WARN L193 SmtUtils]: Spent 114.00 ms on a formula simplification that was a NOOP. DAG size: 109 [2020-11-29 22:51:03,833 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-29 22:51:03,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 22:51:03,926 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-11-29 22:51:03,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 22:51:03,956 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-11-29 22:51:03,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 22:51:03,977 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2020-11-29 22:51:03,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 22:51:04,097 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-29 22:51:04,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 22:51:04,100 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-11-29 22:51:04,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 22:51:04,123 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-11-29 22:51:04,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 22:51:04,149 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-29 22:51:04,149 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1744699091] [2020-11-29 22:51:04,149 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-29 22:51:04,150 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-11-29 22:51:04,150 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [231015084] [2020-11-29 22:51:04,150 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-11-29 22:51:04,150 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 22:51:04,151 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-11-29 22:51:04,151 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2020-11-29 22:51:04,151 INFO L87 Difference]: Start difference. First operand 479 states and 591 transitions. Second operand 12 states. [2020-11-29 22:51:04,331 WARN L193 SmtUtils]: Spent 133.00 ms on a formula simplification that was a NOOP. DAG size: 114 [2020-11-29 22:51:04,481 WARN L193 SmtUtils]: Spent 113.00 ms on a formula simplification that was a NOOP. DAG size: 113 [2020-11-29 22:51:05,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 22:51:05,511 INFO L93 Difference]: Finished difference Result 512 states and 632 transitions. [2020-11-29 22:51:05,512 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-11-29 22:51:05,512 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 66 [2020-11-29 22:51:05,512 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 22:51:05,514 INFO L225 Difference]: With dead ends: 512 [2020-11-29 22:51:05,514 INFO L226 Difference]: Without dead ends: 512 [2020-11-29 22:51:05,514 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=106, Invalid=314, Unknown=0, NotChecked=0, Total=420 [2020-11-29 22:51:05,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 512 states. [2020-11-29 22:51:05,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 512 to 479. [2020-11-29 22:51:05,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 479 states. [2020-11-29 22:51:05,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 479 states to 479 states and 589 transitions. [2020-11-29 22:51:05,525 INFO L78 Accepts]: Start accepts. Automaton has 479 states and 589 transitions. Word has length 66 [2020-11-29 22:51:05,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 22:51:05,525 INFO L481 AbstractCegarLoop]: Abstraction has 479 states and 589 transitions. [2020-11-29 22:51:05,525 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-11-29 22:51:05,525 INFO L276 IsEmpty]: Start isEmpty. Operand 479 states and 589 transitions. [2020-11-29 22:51:05,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2020-11-29 22:51:05,527 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 22:51:05,527 INFO L422 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] [2020-11-29 22:51:05,527 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2020-11-29 22:51:05,527 INFO L429 AbstractCegarLoop]: === Iteration 26 === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr0ENSURES_VIOLATIONMEMORY_LEAK]=== [2020-11-29 22:51:05,527 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 22:51:05,528 INFO L82 PathProgramCache]: Analyzing trace with hash -794992213, now seen corresponding path program 1 times [2020-11-29 22:51:05,528 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 22:51:05,528 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [312557077] [2020-11-29 22:51:05,528 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 22:51:05,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 22:51:05,700 WARN L193 SmtUtils]: Spent 121.00 ms on a formula simplification that was a NOOP. DAG size: 109 [2020-11-29 22:51:05,701 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-29 22:51:05,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 22:51:05,749 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-11-29 22:51:05,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 22:51:05,772 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-11-29 22:51:05,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 22:51:05,804 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2020-11-29 22:51:05,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 22:51:05,902 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-11-29 22:51:05,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 22:51:05,956 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-29 22:51:05,956 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [312557077] [2020-11-29 22:51:05,956 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-29 22:51:05,956 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2020-11-29 22:51:05,957 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1476864226] [2020-11-29 22:51:05,957 INFO L461 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-11-29 22:51:05,957 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 22:51:05,958 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-11-29 22:51:05,958 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=148, Unknown=0, NotChecked=0, Total=182 [2020-11-29 22:51:05,958 INFO L87 Difference]: Start difference. First operand 479 states and 589 transitions. Second operand 14 states. [2020-11-29 22:51:07,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 22:51:07,703 INFO L93 Difference]: Finished difference Result 520 states and 637 transitions. [2020-11-29 22:51:07,703 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-11-29 22:51:07,703 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 61 [2020-11-29 22:51:07,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 22:51:07,707 INFO L225 Difference]: With dead ends: 520 [2020-11-29 22:51:07,707 INFO L226 Difference]: Without dead ends: 502 [2020-11-29 22:51:07,707 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=42, Invalid=198, Unknown=0, NotChecked=0, Total=240 [2020-11-29 22:51:07,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 502 states. [2020-11-29 22:51:07,716 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 502 to 475. [2020-11-29 22:51:07,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 475 states. [2020-11-29 22:51:07,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 475 states to 475 states and 583 transitions. [2020-11-29 22:51:07,718 INFO L78 Accepts]: Start accepts. Automaton has 475 states and 583 transitions. Word has length 61 [2020-11-29 22:51:07,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 22:51:07,718 INFO L481 AbstractCegarLoop]: Abstraction has 475 states and 583 transitions. [2020-11-29 22:51:07,718 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-11-29 22:51:07,718 INFO L276 IsEmpty]: Start isEmpty. Operand 475 states and 583 transitions. [2020-11-29 22:51:07,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2020-11-29 22:51:07,720 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 22:51:07,720 INFO L422 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] [2020-11-29 22:51:07,720 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2020-11-29 22:51:07,720 INFO L429 AbstractCegarLoop]: === Iteration 27 === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr0ENSURES_VIOLATIONMEMORY_LEAK]=== [2020-11-29 22:51:07,720 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 22:51:07,721 INFO L82 PathProgramCache]: Analyzing trace with hash 779237911, now seen corresponding path program 1 times [2020-11-29 22:51:07,721 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 22:51:07,721 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1871844391] [2020-11-29 22:51:07,721 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 22:51:07,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 22:51:07,897 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-29 22:51:07,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 22:51:07,945 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-11-29 22:51:07,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 22:51:07,967 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-11-29 22:51:07,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 22:51:07,988 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2020-11-29 22:51:07,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 22:51:08,049 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-29 22:51:08,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 22:51:08,051 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-11-29 22:51:08,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 22:51:08,069 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-11-29 22:51:08,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 22:51:08,080 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-29 22:51:08,081 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1871844391] [2020-11-29 22:51:08,081 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-29 22:51:08,081 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-11-29 22:51:08,081 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [218094986] [2020-11-29 22:51:08,082 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-11-29 22:51:08,082 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 22:51:08,082 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-11-29 22:51:08,083 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2020-11-29 22:51:08,083 INFO L87 Difference]: Start difference. First operand 475 states and 583 transitions. Second operand 12 states. [2020-11-29 22:51:09,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 22:51:09,809 INFO L93 Difference]: Finished difference Result 527 states and 648 transitions. [2020-11-29 22:51:09,810 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2020-11-29 22:51:09,810 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 69 [2020-11-29 22:51:09,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 22:51:09,812 INFO L225 Difference]: With dead ends: 527 [2020-11-29 22:51:09,812 INFO L226 Difference]: Without dead ends: 527 [2020-11-29 22:51:09,812 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=60, Invalid=180, Unknown=0, NotChecked=0, Total=240 [2020-11-29 22:51:09,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 527 states. [2020-11-29 22:51:09,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 527 to 475. [2020-11-29 22:51:09,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 475 states. [2020-11-29 22:51:09,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 475 states to 475 states and 581 transitions. [2020-11-29 22:51:09,824 INFO L78 Accepts]: Start accepts. Automaton has 475 states and 581 transitions. Word has length 69 [2020-11-29 22:51:09,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 22:51:09,825 INFO L481 AbstractCegarLoop]: Abstraction has 475 states and 581 transitions. [2020-11-29 22:51:09,825 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-11-29 22:51:09,825 INFO L276 IsEmpty]: Start isEmpty. Operand 475 states and 581 transitions. [2020-11-29 22:51:09,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2020-11-29 22:51:09,826 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 22:51:09,826 INFO L422 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] [2020-11-29 22:51:09,827 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2020-11-29 22:51:09,827 INFO L429 AbstractCegarLoop]: === Iteration 28 === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr0ENSURES_VIOLATIONMEMORY_LEAK]=== [2020-11-29 22:51:09,827 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 22:51:09,827 INFO L82 PathProgramCache]: Analyzing trace with hash 664234734, now seen corresponding path program 1 times [2020-11-29 22:51:09,828 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 22:51:09,828 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1237264720] [2020-11-29 22:51:09,828 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 22:51:09,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 22:51:10,019 WARN L193 SmtUtils]: Spent 138.00 ms on a formula simplification that was a NOOP. DAG size: 109 [2020-11-29 22:51:10,020 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-29 22:51:10,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 22:51:10,065 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-11-29 22:51:10,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 22:51:10,089 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-11-29 22:51:10,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 22:51:10,118 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2020-11-29 22:51:10,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 22:51:10,183 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-11-29 22:51:10,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 22:51:10,224 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-29 22:51:10,224 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1237264720] [2020-11-29 22:51:10,224 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-29 22:51:10,224 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2020-11-29 22:51:10,225 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [566582164] [2020-11-29 22:51:10,225 INFO L461 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-11-29 22:51:10,225 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 22:51:10,226 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-11-29 22:51:10,226 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=148, Unknown=0, NotChecked=0, Total=182 [2020-11-29 22:51:10,226 INFO L87 Difference]: Start difference. First operand 475 states and 581 transitions. Second operand 14 states. [2020-11-29 22:51:11,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 22:51:11,955 INFO L93 Difference]: Finished difference Result 516 states and 629 transitions. [2020-11-29 22:51:11,955 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-11-29 22:51:11,956 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 62 [2020-11-29 22:51:11,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 22:51:11,957 INFO L225 Difference]: With dead ends: 516 [2020-11-29 22:51:11,957 INFO L226 Difference]: Without dead ends: 497 [2020-11-29 22:51:11,958 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=42, Invalid=198, Unknown=0, NotChecked=0, Total=240 [2020-11-29 22:51:11,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 497 states. [2020-11-29 22:51:11,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 497 to 470. [2020-11-29 22:51:11,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 470 states. [2020-11-29 22:51:11,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 470 states to 470 states and 574 transitions. [2020-11-29 22:51:11,969 INFO L78 Accepts]: Start accepts. Automaton has 470 states and 574 transitions. Word has length 62 [2020-11-29 22:51:11,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 22:51:11,969 INFO L481 AbstractCegarLoop]: Abstraction has 470 states and 574 transitions. [2020-11-29 22:51:11,969 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-11-29 22:51:11,969 INFO L276 IsEmpty]: Start isEmpty. Operand 470 states and 574 transitions. [2020-11-29 22:51:11,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2020-11-29 22:51:11,971 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 22:51:11,971 INFO L422 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] [2020-11-29 22:51:11,971 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2020-11-29 22:51:11,971 INFO L429 AbstractCegarLoop]: === Iteration 29 === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr0ENSURES_VIOLATIONMEMORY_LEAK]=== [2020-11-29 22:51:11,971 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 22:51:11,972 INFO L82 PathProgramCache]: Analyzing trace with hash 1895550236, now seen corresponding path program 1 times [2020-11-29 22:51:11,972 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 22:51:11,972 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [744622253] [2020-11-29 22:51:11,972 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 22:51:11,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 22:51:12,118 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-29 22:51:12,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 22:51:12,151 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-11-29 22:51:12,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 22:51:12,169 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-11-29 22:51:12,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 22:51:12,250 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2020-11-29 22:51:12,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 22:51:12,349 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-11-29 22:51:12,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 22:51:12,393 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-29 22:51:12,393 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [744622253] [2020-11-29 22:51:12,393 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-29 22:51:12,394 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2020-11-29 22:51:12,394 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2060522404] [2020-11-29 22:51:12,394 INFO L461 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-11-29 22:51:12,394 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 22:51:12,395 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-11-29 22:51:12,395 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=148, Unknown=0, NotChecked=0, Total=182 [2020-11-29 22:51:12,395 INFO L87 Difference]: Start difference. First operand 470 states and 574 transitions. Second operand 14 states. [2020-11-29 22:51:13,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 22:51:13,934 INFO L93 Difference]: Finished difference Result 511 states and 622 transitions. [2020-11-29 22:51:13,934 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-11-29 22:51:13,935 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 62 [2020-11-29 22:51:13,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 22:51:13,937 INFO L225 Difference]: With dead ends: 511 [2020-11-29 22:51:13,937 INFO L226 Difference]: Without dead ends: 493 [2020-11-29 22:51:13,937 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=42, Invalid=198, Unknown=0, NotChecked=0, Total=240 [2020-11-29 22:51:13,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 493 states. [2020-11-29 22:51:13,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 493 to 466. [2020-11-29 22:51:13,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 466 states. [2020-11-29 22:51:13,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 466 states to 466 states and 568 transitions. [2020-11-29 22:51:13,948 INFO L78 Accepts]: Start accepts. Automaton has 466 states and 568 transitions. Word has length 62 [2020-11-29 22:51:13,948 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 22:51:13,948 INFO L481 AbstractCegarLoop]: Abstraction has 466 states and 568 transitions. [2020-11-29 22:51:13,948 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-11-29 22:51:13,948 INFO L276 IsEmpty]: Start isEmpty. Operand 466 states and 568 transitions. [2020-11-29 22:51:13,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2020-11-29 22:51:13,950 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 22:51:13,950 INFO L422 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] [2020-11-29 22:51:13,950 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2020-11-29 22:51:13,950 INFO L429 AbstractCegarLoop]: === Iteration 30 === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr0ENSURES_VIOLATIONMEMORY_LEAK]=== [2020-11-29 22:51:13,951 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 22:51:13,951 INFO L82 PathProgramCache]: Analyzing trace with hash 45820735, now seen corresponding path program 1 times [2020-11-29 22:51:13,951 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 22:51:13,951 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [767945221] [2020-11-29 22:51:13,951 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 22:51:13,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 22:51:14,139 WARN L193 SmtUtils]: Spent 134.00 ms on a formula simplification that was a NOOP. DAG size: 109 [2020-11-29 22:51:14,140 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-29 22:51:14,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 22:51:14,179 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-11-29 22:51:14,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 22:51:14,210 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-11-29 22:51:14,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 22:51:14,223 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2020-11-29 22:51:14,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 22:51:14,259 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-29 22:51:14,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 22:51:14,263 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-11-29 22:51:14,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 22:51:14,286 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-11-29 22:51:14,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 22:51:14,297 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-29 22:51:14,298 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [767945221] [2020-11-29 22:51:14,298 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-29 22:51:14,298 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-11-29 22:51:14,298 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1673369371] [2020-11-29 22:51:14,298 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-11-29 22:51:14,299 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 22:51:14,299 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-11-29 22:51:14,299 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2020-11-29 22:51:14,299 INFO L87 Difference]: Start difference. First operand 466 states and 568 transitions. Second operand 9 states. [2020-11-29 22:51:15,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 22:51:15,501 INFO L93 Difference]: Finished difference Result 638 states and 775 transitions. [2020-11-29 22:51:15,502 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-11-29 22:51:15,502 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 68 [2020-11-29 22:51:15,502 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 22:51:15,505 INFO L225 Difference]: With dead ends: 638 [2020-11-29 22:51:15,505 INFO L226 Difference]: Without dead ends: 638 [2020-11-29 22:51:15,505 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=57, Invalid=99, Unknown=0, NotChecked=0, Total=156 [2020-11-29 22:51:15,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 638 states. [2020-11-29 22:51:15,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 638 to 587. [2020-11-29 22:51:15,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 587 states. [2020-11-29 22:51:15,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 587 states to 587 states and 716 transitions. [2020-11-29 22:51:15,519 INFO L78 Accepts]: Start accepts. Automaton has 587 states and 716 transitions. Word has length 68 [2020-11-29 22:51:15,519 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 22:51:15,519 INFO L481 AbstractCegarLoop]: Abstraction has 587 states and 716 transitions. [2020-11-29 22:51:15,520 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-11-29 22:51:15,520 INFO L276 IsEmpty]: Start isEmpty. Operand 587 states and 716 transitions. [2020-11-29 22:51:15,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2020-11-29 22:51:15,521 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 22:51:15,521 INFO L422 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] [2020-11-29 22:51:15,521 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2020-11-29 22:51:15,522 INFO L429 AbstractCegarLoop]: === Iteration 31 === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr0ENSURES_VIOLATIONMEMORY_LEAK]=== [2020-11-29 22:51:15,522 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 22:51:15,522 INFO L82 PathProgramCache]: Analyzing trace with hash 2005142669, now seen corresponding path program 1 times [2020-11-29 22:51:15,522 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 22:51:15,522 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1070948357] [2020-11-29 22:51:15,523 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 22:51:15,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 22:51:15,718 WARN L193 SmtUtils]: Spent 138.00 ms on a formula simplification that was a NOOP. DAG size: 109 [2020-11-29 22:51:15,719 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-29 22:51:15,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 22:51:15,780 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-11-29 22:51:15,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 22:51:15,806 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-11-29 22:51:15,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 22:51:15,849 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2020-11-29 22:51:15,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 22:51:15,925 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2020-11-29 22:51:15,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 22:51:15,960 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-29 22:51:15,960 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1070948357] [2020-11-29 22:51:15,960 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-29 22:51:15,960 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2020-11-29 22:51:15,960 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1091774644] [2020-11-29 22:51:15,960 INFO L461 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-11-29 22:51:15,960 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 22:51:15,961 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-11-29 22:51:15,961 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=148, Unknown=0, NotChecked=0, Total=182 [2020-11-29 22:51:15,961 INFO L87 Difference]: Start difference. First operand 587 states and 716 transitions. Second operand 14 states. [2020-11-29 22:51:17,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 22:51:17,548 INFO L93 Difference]: Finished difference Result 628 states and 765 transitions. [2020-11-29 22:51:17,549 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-11-29 22:51:17,549 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 66 [2020-11-29 22:51:17,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 22:51:17,551 INFO L225 Difference]: With dead ends: 628 [2020-11-29 22:51:17,551 INFO L226 Difference]: Without dead ends: 588 [2020-11-29 22:51:17,552 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=42, Invalid=198, Unknown=0, NotChecked=0, Total=240 [2020-11-29 22:51:17,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 588 states. [2020-11-29 22:51:17,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 588 to 561. [2020-11-29 22:51:17,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 561 states. [2020-11-29 22:51:17,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 561 states to 561 states and 684 transitions. [2020-11-29 22:51:17,564 INFO L78 Accepts]: Start accepts. Automaton has 561 states and 684 transitions. Word has length 66 [2020-11-29 22:51:17,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 22:51:17,565 INFO L481 AbstractCegarLoop]: Abstraction has 561 states and 684 transitions. [2020-11-29 22:51:17,565 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-11-29 22:51:17,565 INFO L276 IsEmpty]: Start isEmpty. Operand 561 states and 684 transitions. [2020-11-29 22:51:17,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2020-11-29 22:51:17,566 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 22:51:17,567 INFO L422 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] [2020-11-29 22:51:17,567 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2020-11-29 22:51:17,567 INFO L429 AbstractCegarLoop]: === Iteration 32 === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr0ENSURES_VIOLATIONMEMORY_LEAK]=== [2020-11-29 22:51:17,567 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 22:51:17,568 INFO L82 PathProgramCache]: Analyzing trace with hash -1554058962, now seen corresponding path program 1 times [2020-11-29 22:51:17,568 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 22:51:17,568 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2038175022] [2020-11-29 22:51:17,568 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 22:51:17,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 22:51:17,729 WARN L193 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 109 [2020-11-29 22:51:17,729 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-29 22:51:17,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 22:51:17,769 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-11-29 22:51:17,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 22:51:17,816 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-11-29 22:51:17,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 22:51:17,834 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2020-11-29 22:51:17,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 22:51:17,867 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-29 22:51:17,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 22:51:17,869 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-11-29 22:51:17,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 22:51:17,889 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-11-29 22:51:17,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 22:51:17,917 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2020-11-29 22:51:17,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 22:51:17,942 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-29 22:51:17,942 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2038175022] [2020-11-29 22:51:17,942 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-29 22:51:17,942 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-11-29 22:51:17,942 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [788621324] [2020-11-29 22:51:17,943 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-11-29 22:51:17,943 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 22:51:17,943 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-11-29 22:51:17,944 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2020-11-29 22:51:17,944 INFO L87 Difference]: Start difference. First operand 561 states and 684 transitions. Second operand 11 states. [2020-11-29 22:51:18,124 WARN L193 SmtUtils]: Spent 140.00 ms on a formula simplification that was a NOOP. DAG size: 110 [2020-11-29 22:51:19,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 22:51:19,548 INFO L93 Difference]: Finished difference Result 577 states and 697 transitions. [2020-11-29 22:51:19,548 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2020-11-29 22:51:19,548 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 80 [2020-11-29 22:51:19,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 22:51:19,551 INFO L225 Difference]: With dead ends: 577 [2020-11-29 22:51:19,551 INFO L226 Difference]: Without dead ends: 577 [2020-11-29 22:51:19,551 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=110, Invalid=232, Unknown=0, NotChecked=0, Total=342 [2020-11-29 22:51:19,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 577 states. [2020-11-29 22:51:19,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 577 to 543. [2020-11-29 22:51:19,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 543 states. [2020-11-29 22:51:19,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 543 states to 543 states and 654 transitions. [2020-11-29 22:51:19,563 INFO L78 Accepts]: Start accepts. Automaton has 543 states and 654 transitions. Word has length 80 [2020-11-29 22:51:19,563 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 22:51:19,563 INFO L481 AbstractCegarLoop]: Abstraction has 543 states and 654 transitions. [2020-11-29 22:51:19,563 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-11-29 22:51:19,563 INFO L276 IsEmpty]: Start isEmpty. Operand 543 states and 654 transitions. [2020-11-29 22:51:19,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2020-11-29 22:51:19,565 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 22:51:19,565 INFO L422 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] [2020-11-29 22:51:19,565 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2020-11-29 22:51:19,566 INFO L429 AbstractCegarLoop]: === Iteration 33 === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr0ENSURES_VIOLATIONMEMORY_LEAK]=== [2020-11-29 22:51:19,566 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 22:51:19,566 INFO L82 PathProgramCache]: Analyzing trace with hash -1832737513, now seen corresponding path program 1 times [2020-11-29 22:51:19,566 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 22:51:19,566 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1682310983] [2020-11-29 22:51:19,566 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 22:51:19,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 22:51:19,731 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-29 22:51:19,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 22:51:19,852 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-11-29 22:51:19,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 22:51:19,876 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-11-29 22:51:19,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 22:51:19,895 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2020-11-29 22:51:19,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 22:51:19,954 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-29 22:51:19,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 22:51:19,956 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-11-29 22:51:19,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 22:51:19,982 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-11-29 22:51:19,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 22:51:20,011 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2020-11-29 22:51:20,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 22:51:20,043 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-11-29 22:51:20,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 22:51:20,056 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-29 22:51:20,056 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1682310983] [2020-11-29 22:51:20,056 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-29 22:51:20,056 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2020-11-29 22:51:20,056 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1678373508] [2020-11-29 22:51:20,057 INFO L461 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-11-29 22:51:20,057 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 22:51:20,057 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-11-29 22:51:20,058 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=133, Unknown=0, NotChecked=0, Total=182 [2020-11-29 22:51:20,058 INFO L87 Difference]: Start difference. First operand 543 states and 654 transitions. Second operand 14 states. [2020-11-29 22:51:21,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 22:51:21,375 INFO L93 Difference]: Finished difference Result 652 states and 822 transitions. [2020-11-29 22:51:21,375 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2020-11-29 22:51:21,376 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 81 [2020-11-29 22:51:21,376 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 22:51:21,378 INFO L225 Difference]: With dead ends: 652 [2020-11-29 22:51:21,378 INFO L226 Difference]: Without dead ends: 652 [2020-11-29 22:51:21,378 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=115, Invalid=391, Unknown=0, NotChecked=0, Total=506 [2020-11-29 22:51:21,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 652 states. [2020-11-29 22:51:21,388 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 652 to 507. [2020-11-29 22:51:21,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 507 states. [2020-11-29 22:51:21,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 507 states to 507 states and 608 transitions. [2020-11-29 22:51:21,390 INFO L78 Accepts]: Start accepts. Automaton has 507 states and 608 transitions. Word has length 81 [2020-11-29 22:51:21,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 22:51:21,390 INFO L481 AbstractCegarLoop]: Abstraction has 507 states and 608 transitions. [2020-11-29 22:51:21,390 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-11-29 22:51:21,390 INFO L276 IsEmpty]: Start isEmpty. Operand 507 states and 608 transitions. [2020-11-29 22:51:21,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2020-11-29 22:51:21,392 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 22:51:21,392 INFO L422 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] [2020-11-29 22:51:21,392 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2020-11-29 22:51:21,393 INFO L429 AbstractCegarLoop]: === Iteration 34 === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr0ENSURES_VIOLATIONMEMORY_LEAK]=== [2020-11-29 22:51:21,393 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 22:51:21,393 INFO L82 PathProgramCache]: Analyzing trace with hash -951033128, now seen corresponding path program 1 times [2020-11-29 22:51:21,393 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 22:51:21,393 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [655304223] [2020-11-29 22:51:21,394 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 22:51:21,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 22:51:21,568 WARN L193 SmtUtils]: Spent 112.00 ms on a formula simplification that was a NOOP. DAG size: 109 [2020-11-29 22:51:21,568 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-29 22:51:21,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 22:51:21,619 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-11-29 22:51:21,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 22:51:21,648 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-11-29 22:51:21,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 22:51:21,670 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2020-11-29 22:51:21,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 22:51:21,759 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-11-29 22:51:21,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 22:51:21,837 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-29 22:51:21,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 22:51:21,839 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-11-29 22:51:21,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 22:51:21,863 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-11-29 22:51:21,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 22:51:21,864 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2020-11-29 22:51:21,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 22:51:21,883 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-29 22:51:21,883 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [655304223] [2020-11-29 22:51:21,883 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-29 22:51:21,883 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2020-11-29 22:51:21,884 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [983056596] [2020-11-29 22:51:21,884 INFO L461 AbstractCegarLoop]: Interpolant automaton has 16 states [2020-11-29 22:51:21,884 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 22:51:21,885 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2020-11-29 22:51:21,885 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=192, Unknown=0, NotChecked=0, Total=240 [2020-11-29 22:51:21,885 INFO L87 Difference]: Start difference. First operand 507 states and 608 transitions. Second operand 16 states. [2020-11-29 22:51:23,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 22:51:23,755 INFO L93 Difference]: Finished difference Result 582 states and 697 transitions. [2020-11-29 22:51:23,755 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2020-11-29 22:51:23,755 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 86 [2020-11-29 22:51:23,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 22:51:23,757 INFO L225 Difference]: With dead ends: 582 [2020-11-29 22:51:23,758 INFO L226 Difference]: Without dead ends: 564 [2020-11-29 22:51:23,758 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=101, Invalid=499, Unknown=0, NotChecked=0, Total=600 [2020-11-29 22:51:23,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 564 states. [2020-11-29 22:51:23,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 564 to 515. [2020-11-29 22:51:23,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 515 states. [2020-11-29 22:51:23,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 515 states to 515 states and 618 transitions. [2020-11-29 22:51:23,770 INFO L78 Accepts]: Start accepts. Automaton has 515 states and 618 transitions. Word has length 86 [2020-11-29 22:51:23,770 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 22:51:23,770 INFO L481 AbstractCegarLoop]: Abstraction has 515 states and 618 transitions. [2020-11-29 22:51:23,770 INFO L482 AbstractCegarLoop]: Interpolant automaton has 16 states. [2020-11-29 22:51:23,770 INFO L276 IsEmpty]: Start isEmpty. Operand 515 states and 618 transitions. [2020-11-29 22:51:23,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2020-11-29 22:51:23,772 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 22:51:23,772 INFO L422 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] [2020-11-29 22:51:23,772 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2020-11-29 22:51:23,773 INFO L429 AbstractCegarLoop]: === Iteration 35 === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr0ENSURES_VIOLATIONMEMORY_LEAK]=== [2020-11-29 22:51:23,773 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 22:51:23,773 INFO L82 PathProgramCache]: Analyzing trace with hash 337734436, now seen corresponding path program 1 times [2020-11-29 22:51:23,773 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 22:51:23,773 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1980471364] [2020-11-29 22:51:23,774 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 22:51:23,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 22:51:23,932 WARN L193 SmtUtils]: Spent 110.00 ms on a formula simplification that was a NOOP. DAG size: 109 [2020-11-29 22:51:23,932 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-29 22:51:23,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 22:51:23,974 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-11-29 22:51:23,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 22:51:23,991 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-11-29 22:51:23,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 22:51:24,021 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2020-11-29 22:51:24,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 22:51:24,104 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2020-11-29 22:51:24,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 22:51:24,128 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2020-11-29 22:51:24,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 22:51:24,159 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2020-11-29 22:51:24,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 22:51:24,179 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-29 22:51:24,180 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1980471364] [2020-11-29 22:51:24,180 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-29 22:51:24,180 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-11-29 22:51:24,180 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1969266734] [2020-11-29 22:51:24,182 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-11-29 22:51:24,182 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 22:51:24,182 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-11-29 22:51:24,182 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2020-11-29 22:51:24,183 INFO L87 Difference]: Start difference. First operand 515 states and 618 transitions. Second operand 12 states. [2020-11-29 22:51:24,356 WARN L193 SmtUtils]: Spent 129.00 ms on a formula simplification that was a NOOP. DAG size: 111 [2020-11-29 22:51:26,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 22:51:26,142 INFO L93 Difference]: Finished difference Result 669 states and 783 transitions. [2020-11-29 22:51:26,142 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2020-11-29 22:51:26,142 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 81 [2020-11-29 22:51:26,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 22:51:26,145 INFO L225 Difference]: With dead ends: 669 [2020-11-29 22:51:26,145 INFO L226 Difference]: Without dead ends: 669 [2020-11-29 22:51:26,145 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=124, Invalid=338, Unknown=0, NotChecked=0, Total=462 [2020-11-29 22:51:26,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 669 states. [2020-11-29 22:51:26,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 669 to 636. [2020-11-29 22:51:26,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 636 states. [2020-11-29 22:51:26,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 636 states to 636 states and 750 transitions. [2020-11-29 22:51:26,157 INFO L78 Accepts]: Start accepts. Automaton has 636 states and 750 transitions. Word has length 81 [2020-11-29 22:51:26,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 22:51:26,157 INFO L481 AbstractCegarLoop]: Abstraction has 636 states and 750 transitions. [2020-11-29 22:51:26,157 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-11-29 22:51:26,157 INFO L276 IsEmpty]: Start isEmpty. Operand 636 states and 750 transitions. [2020-11-29 22:51:26,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2020-11-29 22:51:26,159 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 22:51:26,159 INFO L422 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] [2020-11-29 22:51:26,160 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2020-11-29 22:51:26,160 INFO L429 AbstractCegarLoop]: === Iteration 36 === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr0ENSURES_VIOLATIONMEMORY_LEAK]=== [2020-11-29 22:51:26,160 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 22:51:26,160 INFO L82 PathProgramCache]: Analyzing trace with hash 1820694455, now seen corresponding path program 1 times [2020-11-29 22:51:26,160 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 22:51:26,161 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1587400876] [2020-11-29 22:51:26,161 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 22:51:26,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 22:51:26,351 WARN L193 SmtUtils]: Spent 118.00 ms on a formula simplification that was a NOOP. DAG size: 109 [2020-11-29 22:51:26,352 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-29 22:51:26,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 22:51:26,409 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-11-29 22:51:26,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 22:51:26,430 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-11-29 22:51:26,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 22:51:26,450 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2020-11-29 22:51:26,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 22:51:26,535 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-11-29 22:51:26,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 22:51:26,602 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-29 22:51:26,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 22:51:26,604 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-11-29 22:51:26,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 22:51:26,627 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-11-29 22:51:26,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 22:51:26,630 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2020-11-29 22:51:26,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 22:51:26,647 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-29 22:51:26,648 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1587400876] [2020-11-29 22:51:26,648 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-29 22:51:26,648 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2020-11-29 22:51:26,648 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [356956135] [2020-11-29 22:51:26,648 INFO L461 AbstractCegarLoop]: Interpolant automaton has 16 states [2020-11-29 22:51:26,649 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 22:51:26,649 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2020-11-29 22:51:26,649 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=192, Unknown=0, NotChecked=0, Total=240 [2020-11-29 22:51:26,649 INFO L87 Difference]: Start difference. First operand 636 states and 750 transitions. Second operand 16 states. [2020-11-29 22:51:27,619 WARN L193 SmtUtils]: Spent 115.00 ms on a formula simplification that was a NOOP. DAG size: 114 [2020-11-29 22:51:28,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 22:51:28,078 INFO L93 Difference]: Finished difference Result 683 states and 799 transitions. [2020-11-29 22:51:28,079 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2020-11-29 22:51:28,079 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 87 [2020-11-29 22:51:28,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 22:51:28,081 INFO L225 Difference]: With dead ends: 683 [2020-11-29 22:51:28,081 INFO L226 Difference]: Without dead ends: 665 [2020-11-29 22:51:28,081 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=82, Invalid=380, Unknown=0, NotChecked=0, Total=462 [2020-11-29 22:51:28,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 665 states. [2020-11-29 22:51:28,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 665 to 628. [2020-11-29 22:51:28,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 628 states. [2020-11-29 22:51:28,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 628 states to 628 states and 740 transitions. [2020-11-29 22:51:28,092 INFO L78 Accepts]: Start accepts. Automaton has 628 states and 740 transitions. Word has length 87 [2020-11-29 22:51:28,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 22:51:28,093 INFO L481 AbstractCegarLoop]: Abstraction has 628 states and 740 transitions. [2020-11-29 22:51:28,093 INFO L482 AbstractCegarLoop]: Interpolant automaton has 16 states. [2020-11-29 22:51:28,093 INFO L276 IsEmpty]: Start isEmpty. Operand 628 states and 740 transitions. [2020-11-29 22:51:28,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2020-11-29 22:51:28,094 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 22:51:28,095 INFO L422 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] [2020-11-29 22:51:28,095 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2020-11-29 22:51:28,095 INFO L429 AbstractCegarLoop]: === Iteration 37 === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr0ENSURES_VIOLATIONMEMORY_LEAK]=== [2020-11-29 22:51:28,095 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 22:51:28,095 INFO L82 PathProgramCache]: Analyzing trace with hash 1581722719, now seen corresponding path program 1 times [2020-11-29 22:51:28,096 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 22:51:28,096 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [889650919] [2020-11-29 22:51:28,096 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 22:51:28,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 22:51:28,259 WARN L193 SmtUtils]: Spent 115.00 ms on a formula simplification that was a NOOP. DAG size: 109 [2020-11-29 22:51:28,260 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-29 22:51:28,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 22:51:28,324 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-11-29 22:51:28,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 22:51:28,360 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-11-29 22:51:28,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 22:51:28,395 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2020-11-29 22:51:28,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 22:51:28,453 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2020-11-29 22:51:28,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 22:51:28,487 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2020-11-29 22:51:28,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 22:51:28,518 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2020-11-29 22:51:28,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 22:51:28,536 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-29 22:51:28,537 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [889650919] [2020-11-29 22:51:28,537 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-29 22:51:28,537 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-11-29 22:51:28,538 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1049917978] [2020-11-29 22:51:28,540 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-11-29 22:51:28,540 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 22:51:28,540 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-11-29 22:51:28,540 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2020-11-29 22:51:28,541 INFO L87 Difference]: Start difference. First operand 628 states and 740 transitions. Second operand 10 states. [2020-11-29 22:51:29,022 WARN L193 SmtUtils]: Spent 129.00 ms on a formula simplification that was a NOOP. DAG size: 111 [2020-11-29 22:51:29,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 22:51:29,744 INFO L93 Difference]: Finished difference Result 635 states and 744 transitions. [2020-11-29 22:51:29,744 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-11-29 22:51:29,744 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 82 [2020-11-29 22:51:29,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 22:51:29,746 INFO L225 Difference]: With dead ends: 635 [2020-11-29 22:51:29,746 INFO L226 Difference]: Without dead ends: 582 [2020-11-29 22:51:29,747 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=80, Invalid=160, Unknown=0, NotChecked=0, Total=240 [2020-11-29 22:51:29,747 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 582 states. [2020-11-29 22:51:29,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 582 to 580. [2020-11-29 22:51:29,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 580 states. [2020-11-29 22:51:29,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 580 states to 580 states and 683 transitions. [2020-11-29 22:51:29,757 INFO L78 Accepts]: Start accepts. Automaton has 580 states and 683 transitions. Word has length 82 [2020-11-29 22:51:29,758 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 22:51:29,758 INFO L481 AbstractCegarLoop]: Abstraction has 580 states and 683 transitions. [2020-11-29 22:51:29,758 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-11-29 22:51:29,758 INFO L276 IsEmpty]: Start isEmpty. Operand 580 states and 683 transitions. [2020-11-29 22:51:29,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2020-11-29 22:51:29,760 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 22:51:29,760 INFO L422 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] [2020-11-29 22:51:29,760 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2020-11-29 22:51:29,760 INFO L429 AbstractCegarLoop]: === Iteration 38 === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr0ENSURES_VIOLATIONMEMORY_LEAK]=== [2020-11-29 22:51:29,761 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 22:51:29,761 INFO L82 PathProgramCache]: Analyzing trace with hash 1969544837, now seen corresponding path program 1 times [2020-11-29 22:51:29,761 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 22:51:29,761 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [714774744] [2020-11-29 22:51:29,761 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 22:51:29,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 22:51:29,948 WARN L193 SmtUtils]: Spent 144.00 ms on a formula simplification that was a NOOP. DAG size: 109 [2020-11-29 22:51:29,949 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-29 22:51:29,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 22:51:29,995 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-11-29 22:51:29,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 22:51:30,019 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-11-29 22:51:30,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 22:51:30,044 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2020-11-29 22:51:30,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 22:51:30,097 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2020-11-29 22:51:30,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 22:51:30,152 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-11-29 22:51:30,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 22:51:30,185 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2020-11-29 22:51:30,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 22:51:30,213 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2020-11-29 22:51:30,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 22:51:30,232 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-29 22:51:30,232 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [714774744] [2020-11-29 22:51:30,232 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-29 22:51:30,233 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-11-29 22:51:30,233 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [672750156] [2020-11-29 22:51:30,234 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-11-29 22:51:30,234 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 22:51:30,235 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-11-29 22:51:30,235 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2020-11-29 22:51:30,235 INFO L87 Difference]: Start difference. First operand 580 states and 683 transitions. Second operand 12 states. [2020-11-29 22:51:30,408 WARN L193 SmtUtils]: Spent 132.00 ms on a formula simplification that was a NOOP. DAG size: 111 [2020-11-29 22:51:30,753 WARN L193 SmtUtils]: Spent 149.00 ms on a formula simplification that was a NOOP. DAG size: 111 [2020-11-29 22:51:33,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 22:51:33,018 INFO L93 Difference]: Finished difference Result 1265 states and 1481 transitions. [2020-11-29 22:51:33,018 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2020-11-29 22:51:33,018 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 91 [2020-11-29 22:51:33,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 22:51:33,022 INFO L225 Difference]: With dead ends: 1265 [2020-11-29 22:51:33,023 INFO L226 Difference]: Without dead ends: 1265 [2020-11-29 22:51:33,023 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 139 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=202, Invalid=500, Unknown=0, NotChecked=0, Total=702 [2020-11-29 22:51:33,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1265 states. [2020-11-29 22:51:33,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1265 to 1136. [2020-11-29 22:51:33,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1136 states. [2020-11-29 22:51:33,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1136 states to 1136 states and 1345 transitions. [2020-11-29 22:51:33,048 INFO L78 Accepts]: Start accepts. Automaton has 1136 states and 1345 transitions. Word has length 91 [2020-11-29 22:51:33,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 22:51:33,048 INFO L481 AbstractCegarLoop]: Abstraction has 1136 states and 1345 transitions. [2020-11-29 22:51:33,048 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-11-29 22:51:33,048 INFO L276 IsEmpty]: Start isEmpty. Operand 1136 states and 1345 transitions. [2020-11-29 22:51:33,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2020-11-29 22:51:33,051 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 22:51:33,051 INFO L422 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] [2020-11-29 22:51:33,051 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2020-11-29 22:51:33,052 INFO L429 AbstractCegarLoop]: === Iteration 39 === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr0ENSURES_VIOLATIONMEMORY_LEAK]=== [2020-11-29 22:51:33,052 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 22:51:33,052 INFO L82 PathProgramCache]: Analyzing trace with hash -18874171, now seen corresponding path program 1 times [2020-11-29 22:51:33,052 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 22:51:33,052 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [657668218] [2020-11-29 22:51:33,053 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 22:51:33,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 22:51:33,186 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-29 22:51:33,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 22:51:33,220 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-11-29 22:51:33,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 22:51:33,235 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-11-29 22:51:33,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 22:51:33,253 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2020-11-29 22:51:33,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 22:51:33,288 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2020-11-29 22:51:33,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 22:51:33,330 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-11-29 22:51:33,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 22:51:33,366 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2020-11-29 22:51:33,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 22:51:33,382 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2020-11-29 22:51:33,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 22:51:33,395 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-29 22:51:33,395 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [657668218] [2020-11-29 22:51:33,395 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-29 22:51:33,395 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-11-29 22:51:33,395 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [958799804] [2020-11-29 22:51:33,395 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-11-29 22:51:33,395 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 22:51:33,396 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-11-29 22:51:33,396 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2020-11-29 22:51:33,396 INFO L87 Difference]: Start difference. First operand 1136 states and 1345 transitions. Second operand 12 states. [2020-11-29 22:51:34,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 22:51:34,632 INFO L93 Difference]: Finished difference Result 1152 states and 1361 transitions. [2020-11-29 22:51:34,632 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-11-29 22:51:34,632 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 91 [2020-11-29 22:51:34,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 22:51:34,636 INFO L225 Difference]: With dead ends: 1152 [2020-11-29 22:51:34,636 INFO L226 Difference]: Without dead ends: 1152 [2020-11-29 22:51:34,636 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=88, Invalid=218, Unknown=0, NotChecked=0, Total=306 [2020-11-29 22:51:34,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1152 states. [2020-11-29 22:51:34,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1152 to 1148. [2020-11-29 22:51:34,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1148 states. [2020-11-29 22:51:34,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1148 states to 1148 states and 1357 transitions. [2020-11-29 22:51:34,656 INFO L78 Accepts]: Start accepts. Automaton has 1148 states and 1357 transitions. Word has length 91 [2020-11-29 22:51:34,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 22:51:34,657 INFO L481 AbstractCegarLoop]: Abstraction has 1148 states and 1357 transitions. [2020-11-29 22:51:34,657 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-11-29 22:51:34,657 INFO L276 IsEmpty]: Start isEmpty. Operand 1148 states and 1357 transitions. [2020-11-29 22:51:34,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2020-11-29 22:51:34,659 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 22:51:34,659 INFO L422 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] [2020-11-29 22:51:34,659 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2020-11-29 22:51:34,659 INFO L429 AbstractCegarLoop]: === Iteration 40 === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr0ENSURES_VIOLATIONMEMORY_LEAK]=== [2020-11-29 22:51:34,660 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 22:51:34,660 INFO L82 PathProgramCache]: Analyzing trace with hash 1262380454, now seen corresponding path program 1 times [2020-11-29 22:51:34,660 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 22:51:34,660 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1639570684] [2020-11-29 22:51:34,660 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 22:51:34,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 22:51:34,855 WARN L193 SmtUtils]: Spent 127.00 ms on a formula simplification that was a NOOP. DAG size: 109 [2020-11-29 22:51:34,855 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-29 22:51:34,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 22:51:34,906 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-11-29 22:51:34,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 22:51:34,929 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-11-29 22:51:34,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 22:51:34,958 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2020-11-29 22:51:34,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 22:51:35,024 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2020-11-29 22:51:35,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 22:51:35,028 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-11-29 22:51:35,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 22:51:35,057 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2020-11-29 22:51:35,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 22:51:35,082 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2020-11-29 22:51:35,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 22:51:35,133 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-29 22:51:35,133 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1639570684] [2020-11-29 22:51:35,133 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-29 22:51:35,133 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2020-11-29 22:51:35,133 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [845460080] [2020-11-29 22:51:35,134 INFO L461 AbstractCegarLoop]: Interpolant automaton has 16 states [2020-11-29 22:51:35,134 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 22:51:35,134 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2020-11-29 22:51:35,135 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=196, Unknown=0, NotChecked=0, Total=240 [2020-11-29 22:51:35,135 INFO L87 Difference]: Start difference. First operand 1148 states and 1357 transitions. Second operand 16 states. [2020-11-29 22:51:37,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 22:51:37,130 INFO L93 Difference]: Finished difference Result 1151 states and 1359 transitions. [2020-11-29 22:51:37,130 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2020-11-29 22:51:37,130 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 91 [2020-11-29 22:51:37,130 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 22:51:37,133 INFO L225 Difference]: With dead ends: 1151 [2020-11-29 22:51:37,133 INFO L226 Difference]: Without dead ends: 952 [2020-11-29 22:51:37,134 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=81, Invalid=381, Unknown=0, NotChecked=0, Total=462 [2020-11-29 22:51:37,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 952 states. [2020-11-29 22:51:37,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 952 to 948. [2020-11-29 22:51:37,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 948 states. [2020-11-29 22:51:37,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 948 states to 948 states and 1124 transitions. [2020-11-29 22:51:37,151 INFO L78 Accepts]: Start accepts. Automaton has 948 states and 1124 transitions. Word has length 91 [2020-11-29 22:51:37,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 22:51:37,151 INFO L481 AbstractCegarLoop]: Abstraction has 948 states and 1124 transitions. [2020-11-29 22:51:37,151 INFO L482 AbstractCegarLoop]: Interpolant automaton has 16 states. [2020-11-29 22:51:37,152 INFO L276 IsEmpty]: Start isEmpty. Operand 948 states and 1124 transitions. [2020-11-29 22:51:37,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2020-11-29 22:51:37,154 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 22:51:37,154 INFO L422 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] [2020-11-29 22:51:37,154 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2020-11-29 22:51:37,154 INFO L429 AbstractCegarLoop]: === Iteration 41 === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr0ENSURES_VIOLATIONMEMORY_LEAK]=== [2020-11-29 22:51:37,155 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 22:51:37,155 INFO L82 PathProgramCache]: Analyzing trace with hash -2007417207, now seen corresponding path program 1 times [2020-11-29 22:51:37,155 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 22:51:37,155 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1901673671] [2020-11-29 22:51:37,155 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 22:51:37,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 22:51:37,312 WARN L193 SmtUtils]: Spent 116.00 ms on a formula simplification that was a NOOP. DAG size: 109 [2020-11-29 22:51:37,312 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-29 22:51:37,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 22:51:37,363 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-11-29 22:51:37,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 22:51:37,379 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-11-29 22:51:37,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 22:51:37,397 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2020-11-29 22:51:37,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 22:51:37,459 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-11-29 22:51:37,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 22:51:37,502 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-29 22:51:37,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 22:51:37,503 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-11-29 22:51:37,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 22:51:37,530 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-11-29 22:51:37,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 22:51:37,559 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2020-11-29 22:51:37,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 22:51:37,561 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2020-11-29 22:51:37,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 22:51:37,577 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-29 22:51:37,577 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1901673671] [2020-11-29 22:51:37,577 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-29 22:51:37,577 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2020-11-29 22:51:37,578 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [25665503] [2020-11-29 22:51:37,578 INFO L461 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-11-29 22:51:37,578 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 22:51:37,578 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-11-29 22:51:37,579 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=132, Unknown=0, NotChecked=0, Total=182 [2020-11-29 22:51:37,579 INFO L87 Difference]: Start difference. First operand 948 states and 1124 transitions. Second operand 14 states. [2020-11-29 22:51:38,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 22:51:38,049 INFO L93 Difference]: Finished difference Result 944 states and 1114 transitions. [2020-11-29 22:51:38,050 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-11-29 22:51:38,050 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 97 [2020-11-29 22:51:38,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 22:51:38,053 INFO L225 Difference]: With dead ends: 944 [2020-11-29 22:51:38,053 INFO L226 Difference]: Without dead ends: 940 [2020-11-29 22:51:38,053 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=64, Invalid=176, Unknown=0, NotChecked=0, Total=240 [2020-11-29 22:51:38,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 940 states. [2020-11-29 22:51:38,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 940 to 834. [2020-11-29 22:51:38,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 834 states. [2020-11-29 22:51:38,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 834 states to 834 states and 978 transitions. [2020-11-29 22:51:38,066 INFO L78 Accepts]: Start accepts. Automaton has 834 states and 978 transitions. Word has length 97 [2020-11-29 22:51:38,066 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 22:51:38,066 INFO L481 AbstractCegarLoop]: Abstraction has 834 states and 978 transitions. [2020-11-29 22:51:38,066 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-11-29 22:51:38,066 INFO L276 IsEmpty]: Start isEmpty. Operand 834 states and 978 transitions. [2020-11-29 22:51:38,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2020-11-29 22:51:38,069 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 22:51:38,069 INFO L422 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] [2020-11-29 22:51:38,069 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2020-11-29 22:51:38,069 INFO L429 AbstractCegarLoop]: === Iteration 42 === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr0ENSURES_VIOLATIONMEMORY_LEAK]=== [2020-11-29 22:51:38,070 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 22:51:38,070 INFO L82 PathProgramCache]: Analyzing trace with hash 364277250, now seen corresponding path program 1 times [2020-11-29 22:51:38,070 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 22:51:38,070 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [221465783] [2020-11-29 22:51:38,070 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 22:51:38,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 22:51:38,239 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-29 22:51:38,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 22:51:38,271 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-11-29 22:51:38,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 22:51:38,296 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-11-29 22:51:38,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 22:51:38,316 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2020-11-29 22:51:38,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 22:51:38,377 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-11-29 22:51:38,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 22:51:38,423 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-29 22:51:38,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 22:51:38,425 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-11-29 22:51:38,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 22:51:38,446 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-11-29 22:51:38,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 22:51:38,481 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2020-11-29 22:51:38,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 22:51:38,483 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2020-11-29 22:51:38,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 22:51:38,508 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-29 22:51:38,509 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [221465783] [2020-11-29 22:51:38,509 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-29 22:51:38,509 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2020-11-29 22:51:38,509 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [677751198] [2020-11-29 22:51:38,509 INFO L461 AbstractCegarLoop]: Interpolant automaton has 15 states [2020-11-29 22:51:38,509 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 22:51:38,509 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2020-11-29 22:51:38,509 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=158, Unknown=0, NotChecked=0, Total=210 [2020-11-29 22:51:38,510 INFO L87 Difference]: Start difference. First operand 834 states and 978 transitions. Second operand 15 states. [2020-11-29 22:51:39,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 22:51:39,256 INFO L93 Difference]: Finished difference Result 860 states and 1004 transitions. [2020-11-29 22:51:39,257 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2020-11-29 22:51:39,257 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 97 [2020-11-29 22:51:39,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 22:51:39,260 INFO L225 Difference]: With dead ends: 860 [2020-11-29 22:51:39,260 INFO L226 Difference]: Without dead ends: 802 [2020-11-29 22:51:39,260 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 91 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=142, Invalid=508, Unknown=0, NotChecked=0, Total=650 [2020-11-29 22:51:39,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 802 states. [2020-11-29 22:51:39,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 802 to 794. [2020-11-29 22:51:39,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 794 states. [2020-11-29 22:51:39,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 794 states to 794 states and 928 transitions. [2020-11-29 22:51:39,274 INFO L78 Accepts]: Start accepts. Automaton has 794 states and 928 transitions. Word has length 97 [2020-11-29 22:51:39,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 22:51:39,275 INFO L481 AbstractCegarLoop]: Abstraction has 794 states and 928 transitions. [2020-11-29 22:51:39,275 INFO L482 AbstractCegarLoop]: Interpolant automaton has 15 states. [2020-11-29 22:51:39,275 INFO L276 IsEmpty]: Start isEmpty. Operand 794 states and 928 transitions. [2020-11-29 22:51:39,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2020-11-29 22:51:39,277 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 22:51:39,277 INFO L422 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] [2020-11-29 22:51:39,277 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2020-11-29 22:51:39,277 INFO L429 AbstractCegarLoop]: === Iteration 43 === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr0ENSURES_VIOLATIONMEMORY_LEAK]=== [2020-11-29 22:51:39,278 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 22:51:39,278 INFO L82 PathProgramCache]: Analyzing trace with hash 489823022, now seen corresponding path program 1 times [2020-11-29 22:51:39,278 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 22:51:39,278 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1420969151] [2020-11-29 22:51:39,278 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 22:51:39,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 22:51:39,427 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-29 22:51:39,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 22:51:39,459 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-11-29 22:51:39,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 22:51:39,477 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-11-29 22:51:39,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 22:51:39,497 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2020-11-29 22:51:39,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 22:51:39,637 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-11-29 22:51:39,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 22:51:39,713 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-11-29 22:51:39,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 22:51:39,737 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-29 22:51:39,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 22:51:39,739 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-11-29 22:51:39,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 22:51:39,765 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-11-29 22:51:39,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 22:51:39,796 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2020-11-29 22:51:39,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 22:51:39,820 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-11-29 22:51:39,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 22:51:39,823 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2020-11-29 22:51:39,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 22:51:39,853 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-29 22:51:39,853 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1420969151] [2020-11-29 22:51:39,855 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-29 22:51:39,855 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2020-11-29 22:51:39,855 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1127890391] [2020-11-29 22:51:39,856 INFO L461 AbstractCegarLoop]: Interpolant automaton has 19 states [2020-11-29 22:51:39,856 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 22:51:39,857 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2020-11-29 22:51:39,857 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=269, Unknown=0, NotChecked=0, Total=342 [2020-11-29 22:51:39,857 INFO L87 Difference]: Start difference. First operand 794 states and 928 transitions. Second operand 19 states. [2020-11-29 22:51:40,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 22:51:40,696 INFO L93 Difference]: Finished difference Result 870 states and 1022 transitions. [2020-11-29 22:51:40,697 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2020-11-29 22:51:40,697 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 102 [2020-11-29 22:51:40,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 22:51:40,701 INFO L225 Difference]: With dead ends: 870 [2020-11-29 22:51:40,701 INFO L226 Difference]: Without dead ends: 832 [2020-11-29 22:51:40,701 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=114, Invalid=438, Unknown=0, NotChecked=0, Total=552 [2020-11-29 22:51:40,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 832 states. [2020-11-29 22:51:40,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 832 to 812. [2020-11-29 22:51:40,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 812 states. [2020-11-29 22:51:40,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 812 states to 812 states and 940 transitions. [2020-11-29 22:51:40,724 INFO L78 Accepts]: Start accepts. Automaton has 812 states and 940 transitions. Word has length 102 [2020-11-29 22:51:40,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 22:51:40,726 INFO L481 AbstractCegarLoop]: Abstraction has 812 states and 940 transitions. [2020-11-29 22:51:40,726 INFO L482 AbstractCegarLoop]: Interpolant automaton has 19 states. [2020-11-29 22:51:40,726 INFO L276 IsEmpty]: Start isEmpty. Operand 812 states and 940 transitions. [2020-11-29 22:51:40,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2020-11-29 22:51:40,729 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 22:51:40,729 INFO L422 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] [2020-11-29 22:51:40,730 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2020-11-29 22:51:40,730 INFO L429 AbstractCegarLoop]: === Iteration 44 === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr0ENSURES_VIOLATIONMEMORY_LEAK]=== [2020-11-29 22:51:40,730 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 22:51:40,730 INFO L82 PathProgramCache]: Analyzing trace with hash -47503771, now seen corresponding path program 1 times [2020-11-29 22:51:40,730 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 22:51:40,731 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1024433112] [2020-11-29 22:51:40,731 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 22:51:40,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 22:51:40,934 WARN L193 SmtUtils]: Spent 142.00 ms on a formula simplification that was a NOOP. DAG size: 109 [2020-11-29 22:51:40,934 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-29 22:51:40,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 22:51:40,963 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-11-29 22:51:40,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 22:51:40,978 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-11-29 22:51:40,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 22:51:40,989 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2020-11-29 22:51:40,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 22:51:41,000 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-29 22:51:41,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 22:51:41,001 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-11-29 22:51:41,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 22:51:41,016 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-11-29 22:51:41,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 22:51:41,029 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2020-11-29 22:51:41,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 22:51:41,114 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-11-29 22:51:41,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 22:51:41,116 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2020-11-29 22:51:41,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 22:51:41,159 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-29 22:51:41,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 22:51:41,160 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-11-29 22:51:41,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 22:51:41,162 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-11-29 22:51:41,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 22:51:41,187 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2020-11-29 22:51:41,187 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1024433112] [2020-11-29 22:51:41,188 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-29 22:51:41,188 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2020-11-29 22:51:41,188 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1745741079] [2020-11-29 22:51:41,189 INFO L461 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-11-29 22:51:41,189 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 22:51:41,189 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-11-29 22:51:41,190 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=133, Unknown=0, NotChecked=0, Total=182 [2020-11-29 22:51:41,190 INFO L87 Difference]: Start difference. First operand 812 states and 940 transitions. Second operand 14 states. [2020-11-29 22:51:41,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 22:51:41,793 INFO L93 Difference]: Finished difference Result 715 states and 807 transitions. [2020-11-29 22:51:41,794 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2020-11-29 22:51:41,794 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 111 [2020-11-29 22:51:41,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 22:51:41,796 INFO L225 Difference]: With dead ends: 715 [2020-11-29 22:51:41,796 INFO L226 Difference]: Without dead ends: 715 [2020-11-29 22:51:41,796 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=75, Invalid=231, Unknown=0, NotChecked=0, Total=306 [2020-11-29 22:51:41,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 715 states. [2020-11-29 22:51:41,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 715 to 447. [2020-11-29 22:51:41,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 447 states. [2020-11-29 22:51:41,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 447 states to 447 states and 497 transitions. [2020-11-29 22:51:41,805 INFO L78 Accepts]: Start accepts. Automaton has 447 states and 497 transitions. Word has length 111 [2020-11-29 22:51:41,805 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 22:51:41,805 INFO L481 AbstractCegarLoop]: Abstraction has 447 states and 497 transitions. [2020-11-29 22:51:41,805 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-11-29 22:51:41,805 INFO L276 IsEmpty]: Start isEmpty. Operand 447 states and 497 transitions. [2020-11-29 22:51:41,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2020-11-29 22:51:41,806 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 22:51:41,806 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-29 22:51:41,806 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2020-11-29 22:51:41,806 INFO L429 AbstractCegarLoop]: === Iteration 45 === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr0ENSURES_VIOLATIONMEMORY_LEAK]=== [2020-11-29 22:51:41,806 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 22:51:41,807 INFO L82 PathProgramCache]: Analyzing trace with hash -1951240269, now seen corresponding path program 1 times [2020-11-29 22:51:41,807 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 22:51:41,807 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2062571475] [2020-11-29 22:51:41,807 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 22:51:41,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 22:51:41,942 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-29 22:51:41,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 22:51:41,970 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-11-29 22:51:41,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 22:51:41,985 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-11-29 22:51:41,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 22:51:42,003 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2020-11-29 22:51:42,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 22:51:42,066 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-11-29 22:51:42,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 22:51:42,118 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-11-29 22:51:42,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 22:51:42,135 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-29 22:51:42,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 22:51:42,137 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-11-29 22:51:42,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 22:51:42,153 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-11-29 22:51:42,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 22:51:42,176 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2020-11-29 22:51:42,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 22:51:42,194 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-11-29 22:51:42,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 22:51:42,196 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2020-11-29 22:51:42,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 22:51:42,223 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2020-11-29 22:51:42,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 22:51:42,252 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-29 22:51:42,252 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2062571475] [2020-11-29 22:51:42,252 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-29 22:51:42,252 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2020-11-29 22:51:42,253 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1133273730] [2020-11-29 22:51:42,253 INFO L461 AbstractCegarLoop]: Interpolant automaton has 15 states [2020-11-29 22:51:42,253 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 22:51:42,253 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2020-11-29 22:51:42,254 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=145, Unknown=0, NotChecked=0, Total=210 [2020-11-29 22:51:42,254 INFO L87 Difference]: Start difference. First operand 447 states and 497 transitions. Second operand 15 states. [2020-11-29 22:51:43,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 22:51:43,000 INFO L93 Difference]: Finished difference Result 475 states and 529 transitions. [2020-11-29 22:51:43,000 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-11-29 22:51:43,000 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 118 [2020-11-29 22:51:43,001 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 22:51:43,002 INFO L225 Difference]: With dead ends: 475 [2020-11-29 22:51:43,002 INFO L226 Difference]: Without dead ends: 475 [2020-11-29 22:51:43,002 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=114, Invalid=228, Unknown=0, NotChecked=0, Total=342 [2020-11-29 22:51:43,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 475 states. [2020-11-29 22:51:43,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 475 to 455. [2020-11-29 22:51:43,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 455 states. [2020-11-29 22:51:43,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 455 states to 455 states and 505 transitions. [2020-11-29 22:51:43,007 INFO L78 Accepts]: Start accepts. Automaton has 455 states and 505 transitions. Word has length 118 [2020-11-29 22:51:43,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 22:51:43,007 INFO L481 AbstractCegarLoop]: Abstraction has 455 states and 505 transitions. [2020-11-29 22:51:43,007 INFO L482 AbstractCegarLoop]: Interpolant automaton has 15 states. [2020-11-29 22:51:43,007 INFO L276 IsEmpty]: Start isEmpty. Operand 455 states and 505 transitions. [2020-11-29 22:51:43,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2020-11-29 22:51:43,008 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 22:51:43,008 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-29 22:51:43,008 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2020-11-29 22:51:43,009 INFO L429 AbstractCegarLoop]: === Iteration 46 === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr0ENSURES_VIOLATIONMEMORY_LEAK]=== [2020-11-29 22:51:43,009 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 22:51:43,009 INFO L82 PathProgramCache]: Analyzing trace with hash -620126158, now seen corresponding path program 1 times [2020-11-29 22:51:43,009 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 22:51:43,009 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [394486164] [2020-11-29 22:51:43,009 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 22:51:43,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 22:51:43,190 WARN L193 SmtUtils]: Spent 135.00 ms on a formula simplification that was a NOOP. DAG size: 109 [2020-11-29 22:51:43,190 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-29 22:51:43,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 22:51:43,219 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-11-29 22:51:43,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 22:51:43,234 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-11-29 22:51:43,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 22:51:43,251 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2020-11-29 22:51:43,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 22:51:43,298 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-11-29 22:51:43,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 22:51:43,347 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-11-29 22:51:43,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 22:51:43,360 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-29 22:51:43,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 22:51:43,362 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-11-29 22:51:43,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 22:51:43,400 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-11-29 22:51:43,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 22:51:43,424 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2020-11-29 22:51:43,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 22:51:43,450 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-11-29 22:51:43,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 22:51:43,451 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2020-11-29 22:51:43,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 22:51:43,452 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2020-11-29 22:51:43,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 22:51:43,477 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-29 22:51:43,477 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [394486164] [2020-11-29 22:51:43,477 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-29 22:51:43,478 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2020-11-29 22:51:43,478 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1009339223] [2020-11-29 22:51:43,478 INFO L461 AbstractCegarLoop]: Interpolant automaton has 15 states [2020-11-29 22:51:43,478 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 22:51:43,478 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2020-11-29 22:51:43,479 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=145, Unknown=0, NotChecked=0, Total=210 [2020-11-29 22:51:43,479 INFO L87 Difference]: Start difference. First operand 455 states and 505 transitions. Second operand 15 states. [2020-11-29 22:51:44,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 22:51:44,279 INFO L93 Difference]: Finished difference Result 475 states and 525 transitions. [2020-11-29 22:51:44,280 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-11-29 22:51:44,280 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 118 [2020-11-29 22:51:44,280 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 22:51:44,281 INFO L225 Difference]: With dead ends: 475 [2020-11-29 22:51:44,281 INFO L226 Difference]: Without dead ends: 467 [2020-11-29 22:51:44,281 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=104, Invalid=238, Unknown=0, NotChecked=0, Total=342 [2020-11-29 22:51:44,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 467 states. [2020-11-29 22:51:44,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 467 to 455. [2020-11-29 22:51:44,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 455 states. [2020-11-29 22:51:44,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 455 states to 455 states and 503 transitions. [2020-11-29 22:51:44,288 INFO L78 Accepts]: Start accepts. Automaton has 455 states and 503 transitions. Word has length 118 [2020-11-29 22:51:44,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 22:51:44,288 INFO L481 AbstractCegarLoop]: Abstraction has 455 states and 503 transitions. [2020-11-29 22:51:44,288 INFO L482 AbstractCegarLoop]: Interpolant automaton has 15 states. [2020-11-29 22:51:44,288 INFO L276 IsEmpty]: Start isEmpty. Operand 455 states and 503 transitions. [2020-11-29 22:51:44,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2020-11-29 22:51:44,290 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 22:51:44,291 INFO L422 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] [2020-11-29 22:51:44,291 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45 [2020-11-29 22:51:44,291 INFO L429 AbstractCegarLoop]: === Iteration 47 === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr0ENSURES_VIOLATIONMEMORY_LEAK]=== [2020-11-29 22:51:44,291 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 22:51:44,291 INFO L82 PathProgramCache]: Analyzing trace with hash 1646680362, now seen corresponding path program 1 times [2020-11-29 22:51:44,292 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 22:51:44,292 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [415375395] [2020-11-29 22:51:44,292 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 22:51:44,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 22:51:44,489 WARN L193 SmtUtils]: Spent 120.00 ms on a formula simplification that was a NOOP. DAG size: 109 [2020-11-29 22:51:44,489 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-29 22:51:44,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 22:51:44,539 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-11-29 22:51:44,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 22:51:44,562 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-11-29 22:51:44,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 22:51:44,591 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2020-11-29 22:51:44,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 22:51:44,682 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-11-29 22:51:44,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 22:51:44,790 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-11-29 22:51:44,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 22:51:44,807 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-29 22:51:44,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 22:51:44,809 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-11-29 22:51:44,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 22:51:44,826 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-11-29 22:51:44,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 22:51:44,847 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2020-11-29 22:51:44,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 22:51:44,982 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-11-29 22:51:44,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 22:51:44,983 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2020-11-29 22:51:44,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 22:51:45,032 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-29 22:51:45,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 22:51:45,034 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-11-29 22:51:45,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 22:51:45,035 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-11-29 22:51:45,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 22:51:45,037 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2020-11-29 22:51:45,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 22:51:45,039 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2020-11-29 22:51:45,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 22:51:45,088 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2020-11-29 22:51:45,088 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [415375395] [2020-11-29 22:51:45,088 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-29 22:51:45,088 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [25] imperfect sequences [] total 25 [2020-11-29 22:51:45,089 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1931311786] [2020-11-29 22:51:45,089 INFO L461 AbstractCegarLoop]: Interpolant automaton has 25 states [2020-11-29 22:51:45,089 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 22:51:45,089 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2020-11-29 22:51:45,089 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=515, Unknown=0, NotChecked=0, Total=600 [2020-11-29 22:51:45,089 INFO L87 Difference]: Start difference. First operand 455 states and 503 transitions. Second operand 25 states. [2020-11-29 22:51:46,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 22:51:46,224 INFO L93 Difference]: Finished difference Result 579 states and 659 transitions. [2020-11-29 22:51:46,229 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2020-11-29 22:51:46,229 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 148 [2020-11-29 22:51:46,229 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 22:51:46,230 INFO L225 Difference]: With dead ends: 579 [2020-11-29 22:51:46,230 INFO L226 Difference]: Without dead ends: 529 [2020-11-29 22:51:46,231 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 165 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=148, Invalid=1042, Unknown=0, NotChecked=0, Total=1190 [2020-11-29 22:51:46,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 529 states. [2020-11-29 22:51:46,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 529 to 489. [2020-11-29 22:51:46,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 489 states. [2020-11-29 22:51:46,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 489 states to 489 states and 545 transitions. [2020-11-29 22:51:46,239 INFO L78 Accepts]: Start accepts. Automaton has 489 states and 545 transitions. Word has length 148 [2020-11-29 22:51:46,239 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 22:51:46,239 INFO L481 AbstractCegarLoop]: Abstraction has 489 states and 545 transitions. [2020-11-29 22:51:46,240 INFO L482 AbstractCegarLoop]: Interpolant automaton has 25 states. [2020-11-29 22:51:46,240 INFO L276 IsEmpty]: Start isEmpty. Operand 489 states and 545 transitions. [2020-11-29 22:51:46,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2020-11-29 22:51:46,242 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 22:51:46,242 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-29 22:51:46,242 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46 [2020-11-29 22:51:46,242 INFO L429 AbstractCegarLoop]: === Iteration 48 === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr0ENSURES_VIOLATIONMEMORY_LEAK]=== [2020-11-29 22:51:46,242 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 22:51:46,243 INFO L82 PathProgramCache]: Analyzing trace with hash 557635533, now seen corresponding path program 1 times [2020-11-29 22:51:46,243 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 22:51:46,243 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [761591271] [2020-11-29 22:51:46,243 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 22:51:46,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 22:51:46,427 WARN L193 SmtUtils]: Spent 108.00 ms on a formula simplification that was a NOOP. DAG size: 109 [2020-11-29 22:51:46,427 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-29 22:51:46,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 22:51:46,458 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-11-29 22:51:46,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 22:51:46,475 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-11-29 22:51:46,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 22:51:46,511 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2020-11-29 22:51:46,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 22:51:46,614 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-11-29 22:51:46,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 22:51:46,706 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-11-29 22:51:46,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 22:51:46,729 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-29 22:51:46,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 22:51:46,731 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-11-29 22:51:46,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 22:51:46,753 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-11-29 22:51:46,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 22:51:46,783 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2020-11-29 22:51:46,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 22:51:46,904 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-11-29 22:51:46,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 22:51:46,906 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2020-11-29 22:51:46,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 22:51:46,982 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-29 22:51:46,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 22:51:46,984 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-11-29 22:51:46,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 22:51:46,985 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-11-29 22:51:46,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 22:51:46,989 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2020-11-29 22:51:46,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 22:51:46,991 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2020-11-29 22:51:46,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 22:51:47,042 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2020-11-29 22:51:47,042 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [761591271] [2020-11-29 22:51:47,043 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-29 22:51:47,043 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [24] imperfect sequences [] total 24 [2020-11-29 22:51:47,043 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [601348496] [2020-11-29 22:51:47,043 INFO L461 AbstractCegarLoop]: Interpolant automaton has 24 states [2020-11-29 22:51:47,044 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 22:51:47,044 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2020-11-29 22:51:47,044 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=469, Unknown=0, NotChecked=0, Total=552 [2020-11-29 22:51:47,044 INFO L87 Difference]: Start difference. First operand 489 states and 545 transitions. Second operand 24 states. [2020-11-29 22:51:48,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 22:51:48,428 INFO L93 Difference]: Finished difference Result 527 states and 587 transitions. [2020-11-29 22:51:48,428 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2020-11-29 22:51:48,428 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 149 [2020-11-29 22:51:48,428 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 22:51:48,429 INFO L225 Difference]: With dead ends: 527 [2020-11-29 22:51:48,429 INFO L226 Difference]: Without dead ends: 517 [2020-11-29 22:51:48,430 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 122 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=130, Invalid=740, Unknown=0, NotChecked=0, Total=870 [2020-11-29 22:51:48,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 517 states. [2020-11-29 22:51:48,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 517 to 489. [2020-11-29 22:51:48,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 489 states. [2020-11-29 22:51:48,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 489 states to 489 states and 543 transitions. [2020-11-29 22:51:48,436 INFO L78 Accepts]: Start accepts. Automaton has 489 states and 543 transitions. Word has length 149 [2020-11-29 22:51:48,436 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 22:51:48,436 INFO L481 AbstractCegarLoop]: Abstraction has 489 states and 543 transitions. [2020-11-29 22:51:48,436 INFO L482 AbstractCegarLoop]: Interpolant automaton has 24 states. [2020-11-29 22:51:48,436 INFO L276 IsEmpty]: Start isEmpty. Operand 489 states and 543 transitions. [2020-11-29 22:51:48,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2020-11-29 22:51:48,437 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 22:51:48,438 INFO L422 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] [2020-11-29 22:51:48,438 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47 [2020-11-29 22:51:48,438 INFO L429 AbstractCegarLoop]: === Iteration 49 === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr0ENSURES_VIOLATIONMEMORY_LEAK]=== [2020-11-29 22:51:48,438 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 22:51:48,438 INFO L82 PathProgramCache]: Analyzing trace with hash -1836191273, now seen corresponding path program 1 times [2020-11-29 22:51:48,439 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 22:51:48,439 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [119073543] [2020-11-29 22:51:48,439 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 22:51:48,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 22:51:48,581 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-29 22:51:48,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 22:51:48,612 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-11-29 22:51:48,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 22:51:48,628 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-11-29 22:51:48,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 22:51:48,648 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2020-11-29 22:51:48,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 22:51:48,773 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-11-29 22:51:48,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 22:51:48,897 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-11-29 22:51:48,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 22:51:48,924 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-29 22:51:48,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 22:51:48,926 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-11-29 22:51:48,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 22:51:48,951 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-11-29 22:51:48,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 22:51:48,987 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2020-11-29 22:51:48,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 22:51:49,023 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-11-29 22:51:49,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 22:51:49,025 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2020-11-29 22:51:49,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 22:51:49,029 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-29 22:51:49,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 22:51:49,031 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-11-29 22:51:49,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 22:51:49,032 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-11-29 22:51:49,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 22:51:49,035 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2020-11-29 22:51:49,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 22:51:49,067 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2020-11-29 22:51:49,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 22:51:49,069 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2020-11-29 22:51:49,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 22:51:49,120 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2020-11-29 22:51:49,120 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [119073543] [2020-11-29 22:51:49,120 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-29 22:51:49,120 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2020-11-29 22:51:49,121 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [748969165] [2020-11-29 22:51:49,121 INFO L461 AbstractCegarLoop]: Interpolant automaton has 21 states [2020-11-29 22:51:49,121 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 22:51:49,121 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2020-11-29 22:51:49,122 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=343, Unknown=0, NotChecked=0, Total=420 [2020-11-29 22:51:49,122 INFO L87 Difference]: Start difference. First operand 489 states and 543 transitions. Second operand 21 states. [2020-11-29 22:51:50,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 22:51:50,128 INFO L93 Difference]: Finished difference Result 551 states and 619 transitions. [2020-11-29 22:51:50,129 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2020-11-29 22:51:50,129 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 151 [2020-11-29 22:51:50,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 22:51:50,130 INFO L225 Difference]: With dead ends: 551 [2020-11-29 22:51:50,130 INFO L226 Difference]: Without dead ends: 489 [2020-11-29 22:51:50,130 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 100 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=141, Invalid=671, Unknown=0, NotChecked=0, Total=812 [2020-11-29 22:51:50,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 489 states. [2020-11-29 22:51:50,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 489 to 477. [2020-11-29 22:51:50,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 477 states. [2020-11-29 22:51:50,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 477 states to 477 states and 525 transitions. [2020-11-29 22:51:50,137 INFO L78 Accepts]: Start accepts. Automaton has 477 states and 525 transitions. Word has length 151 [2020-11-29 22:51:50,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 22:51:50,137 INFO L481 AbstractCegarLoop]: Abstraction has 477 states and 525 transitions. [2020-11-29 22:51:50,137 INFO L482 AbstractCegarLoop]: Interpolant automaton has 21 states. [2020-11-29 22:51:50,137 INFO L276 IsEmpty]: Start isEmpty. Operand 477 states and 525 transitions. [2020-11-29 22:51:50,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2020-11-29 22:51:50,139 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 22:51:50,140 INFO L422 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] [2020-11-29 22:51:50,140 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable48 [2020-11-29 22:51:50,140 INFO L429 AbstractCegarLoop]: === Iteration 50 === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr0ENSURES_VIOLATIONMEMORY_LEAK]=== [2020-11-29 22:51:50,140 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 22:51:50,140 INFO L82 PathProgramCache]: Analyzing trace with hash -71568695, now seen corresponding path program 1 times [2020-11-29 22:51:50,141 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 22:51:50,141 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [911786645] [2020-11-29 22:51:50,141 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 22:51:50,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 22:51:50,346 WARN L193 SmtUtils]: Spent 143.00 ms on a formula simplification that was a NOOP. DAG size: 109 [2020-11-29 22:51:50,347 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-29 22:51:50,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 22:51:50,378 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-11-29 22:51:50,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 22:51:50,394 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-11-29 22:51:50,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 22:51:50,413 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2020-11-29 22:51:50,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 22:51:50,484 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-11-29 22:51:50,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 22:51:50,540 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-11-29 22:51:50,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 22:51:50,558 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-29 22:51:50,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 22:51:50,560 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-11-29 22:51:50,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 22:51:50,578 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-11-29 22:51:50,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 22:51:50,601 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2020-11-29 22:51:50,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 22:51:50,618 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-11-29 22:51:50,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 22:51:50,620 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2020-11-29 22:51:50,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 22:51:50,622 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-29 22:51:50,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 22:51:50,624 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-11-29 22:51:50,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 22:51:50,625 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-11-29 22:51:50,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 22:51:50,628 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2020-11-29 22:51:50,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 22:51:50,630 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2020-11-29 22:51:50,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 22:51:50,632 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2020-11-29 22:51:50,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 22:51:50,673 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2020-11-29 22:51:50,673 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [911786645] [2020-11-29 22:51:50,673 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-29 22:51:50,674 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2020-11-29 22:51:50,674 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1625994829] [2020-11-29 22:51:50,674 INFO L461 AbstractCegarLoop]: Interpolant automaton has 15 states [2020-11-29 22:51:50,674 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 22:51:50,675 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2020-11-29 22:51:50,675 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=145, Unknown=0, NotChecked=0, Total=210 [2020-11-29 22:51:50,675 INFO L87 Difference]: Start difference. First operand 477 states and 525 transitions. Second operand 15 states. [2020-11-29 22:51:51,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 22:51:51,274 INFO L93 Difference]: Finished difference Result 471 states and 513 transitions. [2020-11-29 22:51:51,274 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-11-29 22:51:51,274 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 156 [2020-11-29 22:51:51,275 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 22:51:51,275 INFO L225 Difference]: With dead ends: 471 [2020-11-29 22:51:51,275 INFO L226 Difference]: Without dead ends: 449 [2020-11-29 22:51:51,276 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 77 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=147, Invalid=405, Unknown=0, NotChecked=0, Total=552 [2020-11-29 22:51:51,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 449 states. [2020-11-29 22:51:51,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 449 to 421. [2020-11-29 22:51:51,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 421 states. [2020-11-29 22:51:51,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 421 states to 421 states and 457 transitions. [2020-11-29 22:51:51,281 INFO L78 Accepts]: Start accepts. Automaton has 421 states and 457 transitions. Word has length 156 [2020-11-29 22:51:51,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 22:51:51,282 INFO L481 AbstractCegarLoop]: Abstraction has 421 states and 457 transitions. [2020-11-29 22:51:51,282 INFO L482 AbstractCegarLoop]: Interpolant automaton has 15 states. [2020-11-29 22:51:51,282 INFO L276 IsEmpty]: Start isEmpty. Operand 421 states and 457 transitions. [2020-11-29 22:51:51,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2020-11-29 22:51:51,284 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 22:51:51,284 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-29 22:51:51,284 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable49 [2020-11-29 22:51:51,284 INFO L429 AbstractCegarLoop]: === Iteration 51 === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr0ENSURES_VIOLATIONMEMORY_LEAK]=== [2020-11-29 22:51:51,284 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 22:51:51,285 INFO L82 PathProgramCache]: Analyzing trace with hash 1886416111, now seen corresponding path program 1 times [2020-11-29 22:51:51,285 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 22:51:51,285 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1397977859] [2020-11-29 22:51:51,285 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 22:51:51,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 22:51:51,466 WARN L193 SmtUtils]: Spent 126.00 ms on a formula simplification that was a NOOP. DAG size: 109 [2020-11-29 22:51:51,467 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-29 22:51:51,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 22:51:51,518 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-11-29 22:51:51,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 22:51:51,538 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-11-29 22:51:51,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 22:51:51,572 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2020-11-29 22:51:51,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 22:51:51,622 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-11-29 22:51:51,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 22:51:51,683 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-11-29 22:51:51,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 22:51:51,707 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-29 22:51:51,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 22:51:51,709 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-11-29 22:51:51,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 22:51:51,730 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-11-29 22:51:51,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 22:51:51,751 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2020-11-29 22:51:51,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 22:51:51,824 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-11-29 22:51:51,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 22:51:51,826 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2020-11-29 22:51:51,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 22:51:51,871 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-29 22:51:51,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 22:51:51,872 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-11-29 22:51:51,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 22:51:51,874 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-11-29 22:51:51,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 22:51:51,902 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2020-11-29 22:51:51,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 22:51:51,906 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2020-11-29 22:51:51,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 22:51:51,911 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2020-11-29 22:51:51,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 22:51:51,986 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2020-11-29 22:51:51,986 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1397977859] [2020-11-29 22:51:51,986 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-29 22:51:51,986 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2020-11-29 22:51:51,987 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [975154166] [2020-11-29 22:51:51,987 INFO L461 AbstractCegarLoop]: Interpolant automaton has 17 states [2020-11-29 22:51:51,987 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 22:51:51,987 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2020-11-29 22:51:51,988 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=194, Unknown=0, NotChecked=0, Total=272 [2020-11-29 22:51:51,989 INFO L87 Difference]: Start difference. First operand 421 states and 457 transitions. Second operand 17 states. [2020-11-29 22:51:52,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 22:51:52,547 INFO L93 Difference]: Finished difference Result 399 states and 429 transitions. [2020-11-29 22:51:52,547 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-11-29 22:51:52,548 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 158 [2020-11-29 22:51:52,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 22:51:52,548 INFO L225 Difference]: With dead ends: 399 [2020-11-29 22:51:52,548 INFO L226 Difference]: Without dead ends: 379 [2020-11-29 22:51:52,549 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 92 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=124, Invalid=338, Unknown=0, NotChecked=0, Total=462 [2020-11-29 22:51:52,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 379 states. [2020-11-29 22:51:52,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 379 to 379. [2020-11-29 22:51:52,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 379 states. [2020-11-29 22:51:52,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 379 states to 379 states and 407 transitions. [2020-11-29 22:51:52,553 INFO L78 Accepts]: Start accepts. Automaton has 379 states and 407 transitions. Word has length 158 [2020-11-29 22:51:52,553 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 22:51:52,553 INFO L481 AbstractCegarLoop]: Abstraction has 379 states and 407 transitions. [2020-11-29 22:51:52,553 INFO L482 AbstractCegarLoop]: Interpolant automaton has 17 states. [2020-11-29 22:51:52,553 INFO L276 IsEmpty]: Start isEmpty. Operand 379 states and 407 transitions. [2020-11-29 22:51:52,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2020-11-29 22:51:52,555 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 22:51:52,555 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-29 22:51:52,555 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50 [2020-11-29 22:51:52,555 INFO L429 AbstractCegarLoop]: === Iteration 52 === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr0ENSURES_VIOLATIONMEMORY_LEAK]=== [2020-11-29 22:51:52,556 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 22:51:52,556 INFO L82 PathProgramCache]: Analyzing trace with hash -267976237, now seen corresponding path program 1 times [2020-11-29 22:51:52,556 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 22:51:52,556 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1990685655] [2020-11-29 22:51:52,556 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 22:51:52,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 22:51:52,690 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-29 22:51:52,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 22:51:52,721 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-11-29 22:51:52,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 22:51:52,737 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-11-29 22:51:52,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 22:51:52,756 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2020-11-29 22:51:52,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 22:51:52,881 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-11-29 22:51:52,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 22:51:52,982 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-11-29 22:51:52,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 22:51:53,005 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-29 22:51:53,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 22:51:53,007 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-11-29 22:51:53,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 22:51:53,030 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-11-29 22:51:53,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 22:51:53,056 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2020-11-29 22:51:53,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 22:51:53,133 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-11-29 22:51:53,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 22:51:53,135 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2020-11-29 22:51:53,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 22:51:53,138 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-29 22:51:53,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 22:51:53,140 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-11-29 22:51:53,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 22:51:53,141 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-11-29 22:51:53,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 22:51:53,178 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2020-11-29 22:51:53,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 22:51:53,182 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2020-11-29 22:51:53,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 22:51:53,183 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2020-11-29 22:51:53,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 22:51:53,242 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2020-11-29 22:51:53,242 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1990685655] [2020-11-29 22:51:53,242 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-29 22:51:53,243 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2020-11-29 22:51:53,243 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [608576595] [2020-11-29 22:51:53,243 INFO L461 AbstractCegarLoop]: Interpolant automaton has 20 states [2020-11-29 22:51:53,243 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 22:51:53,244 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2020-11-29 22:51:53,244 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=293, Unknown=0, NotChecked=0, Total=380 [2020-11-29 22:51:53,244 INFO L87 Difference]: Start difference. First operand 379 states and 407 transitions. Second operand 20 states. [2020-11-29 22:51:54,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 22:51:54,835 INFO L93 Difference]: Finished difference Result 656 states and 701 transitions. [2020-11-29 22:51:54,836 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2020-11-29 22:51:54,836 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 159 [2020-11-29 22:51:54,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 22:51:54,837 INFO L225 Difference]: With dead ends: 656 [2020-11-29 22:51:54,837 INFO L226 Difference]: Without dead ends: 385 [2020-11-29 22:51:54,837 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 541 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=387, Invalid=1965, Unknown=0, NotChecked=0, Total=2352 [2020-11-29 22:51:54,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 385 states. [2020-11-29 22:51:54,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 385 to 379. [2020-11-29 22:51:54,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 379 states. [2020-11-29 22:51:54,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 379 states to 379 states and 406 transitions. [2020-11-29 22:51:54,843 INFO L78 Accepts]: Start accepts. Automaton has 379 states and 406 transitions. Word has length 159 [2020-11-29 22:51:54,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 22:51:54,843 INFO L481 AbstractCegarLoop]: Abstraction has 379 states and 406 transitions. [2020-11-29 22:51:54,843 INFO L482 AbstractCegarLoop]: Interpolant automaton has 20 states. [2020-11-29 22:51:54,843 INFO L276 IsEmpty]: Start isEmpty. Operand 379 states and 406 transitions. [2020-11-29 22:51:54,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2020-11-29 22:51:54,844 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 22:51:54,845 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-29 22:51:54,845 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable51 [2020-11-29 22:51:54,845 INFO L429 AbstractCegarLoop]: === Iteration 53 === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr0ENSURES_VIOLATIONMEMORY_LEAK]=== [2020-11-29 22:51:54,846 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 22:51:54,846 INFO L82 PathProgramCache]: Analyzing trace with hash -532623727, now seen corresponding path program 1 times [2020-11-29 22:51:54,847 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 22:51:54,847 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1636345545] [2020-11-29 22:51:54,847 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 22:51:54,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 22:51:55,022 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-29 22:51:55,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 22:51:55,055 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-11-29 22:51:55,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 22:51:55,072 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-11-29 22:51:55,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 22:51:55,093 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2020-11-29 22:51:55,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 22:51:55,210 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-11-29 22:51:55,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 22:51:55,297 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-11-29 22:51:55,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 22:51:55,332 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-29 22:51:55,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 22:51:55,334 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-11-29 22:51:55,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 22:51:55,369 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-11-29 22:51:55,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 22:51:55,397 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2020-11-29 22:51:55,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 22:51:55,468 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-11-29 22:51:55,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 22:51:55,469 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2020-11-29 22:51:55,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 22:51:55,472 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-29 22:51:55,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 22:51:55,474 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-11-29 22:51:55,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 22:51:55,475 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-11-29 22:51:55,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 22:51:55,501 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2020-11-29 22:51:55,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 22:51:55,503 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2020-11-29 22:51:55,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 22:51:55,505 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2020-11-29 22:51:55,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 22:51:55,549 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2020-11-29 22:51:55,549 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1636345545] [2020-11-29 22:51:55,549 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-29 22:51:55,549 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [25] imperfect sequences [] total 25 [2020-11-29 22:51:55,549 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1597488385] [2020-11-29 22:51:55,550 INFO L461 AbstractCegarLoop]: Interpolant automaton has 25 states [2020-11-29 22:51:55,550 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 22:51:55,550 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2020-11-29 22:51:55,550 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=503, Unknown=0, NotChecked=0, Total=600 [2020-11-29 22:51:55,550 INFO L87 Difference]: Start difference. First operand 379 states and 406 transitions. Second operand 25 states. [2020-11-29 22:51:57,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 22:51:57,081 INFO L93 Difference]: Finished difference Result 381 states and 410 transitions. [2020-11-29 22:51:57,081 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2020-11-29 22:51:57,081 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 159 [2020-11-29 22:51:57,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 22:51:57,082 INFO L225 Difference]: With dead ends: 381 [2020-11-29 22:51:57,082 INFO L226 Difference]: Without dead ends: 0 [2020-11-29 22:51:57,082 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 324 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=265, Invalid=1715, Unknown=0, NotChecked=0, Total=1980 [2020-11-29 22:51:57,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-11-29 22:51:57,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-11-29 22:51:57,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-11-29 22:51:57,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-11-29 22:51:57,083 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 159 [2020-11-29 22:51:57,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 22:51:57,083 INFO L481 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-11-29 22:51:57,083 INFO L482 AbstractCegarLoop]: Interpolant automaton has 25 states. [2020-11-29 22:51:57,083 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-11-29 22:51:57,083 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-11-29 22:51:57,083 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable52 [2020-11-29 22:51:57,087 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 29.11 10:51:57 BoogieIcfgContainer [2020-11-29 22:51:57,088 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-11-29 22:51:57,088 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-11-29 22:51:57,088 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-11-29 22:51:57,088 INFO L275 PluginConnector]: Witness Printer initialized [2020-11-29 22:51:57,089 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 10:50:09" (3/4) ... [2020-11-29 22:51:57,092 INFO L137 WitnessPrinter]: Generating witness for correct program [2020-11-29 22:51:57,099 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure reach_error [2020-11-29 22:51:57,099 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure IoRegisterDeviceInterface [2020-11-29 22:51:57,099 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure _BLAST_init [2020-11-29 22:51:57,100 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure FloppyProcessQueuedRequests [2020-11-29 22:51:57,100 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure IoSetDeviceInterfaceState [2020-11-29 22:51:57,100 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure FloppyPnp [2020-11-29 22:51:57,100 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2020-11-29 22:51:57,100 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure FloppyCreateClose [2020-11-29 22:51:57,100 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure stubMoreProcessingRequired [2020-11-29 22:51:57,100 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure FloppyPnpComplete [2020-11-29 22:51:57,100 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure KeWaitForSingleObject [2020-11-29 22:51:57,101 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure IofCompleteRequest [2020-11-29 22:51:57,101 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure FloppyStartDevice [2020-11-29 22:51:57,101 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure PsCreateSystemThread [2020-11-29 22:51:57,101 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ObReferenceObjectByHandle [2020-11-29 22:51:57,101 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure IoBuildDeviceIoControlRequest [2020-11-29 22:51:57,101 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure KeSetEvent [2020-11-29 22:51:57,101 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure stub_driver_init [2020-11-29 22:51:57,101 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure errorFn [2020-11-29 22:51:57,101 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure FlQueueIrpToThread [2020-11-29 22:51:57,102 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure IofCallDriver [2020-11-29 22:51:57,102 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2020-11-29 22:51:57,102 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure FlFdcDeviceIo [2020-11-29 22:51:57,102 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure FlAcpiConfigureFloppy [2020-11-29 22:51:57,102 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure IoDeleteSymbolicLink [2020-11-29 22:51:57,103 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure IoQueryDeviceDescription [2020-11-29 22:51:57,103 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ZwClose [2020-11-29 22:51:57,121 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 79 nodes and edges [2020-11-29 22:51:57,123 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 45 nodes and edges [2020-11-29 22:51:57,125 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2020-11-29 22:51:57,127 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2020-11-29 22:51:57,277 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_fd7968c7-9ac4-402c-a313-819610fc3fc4/bin/uautomizer/witness.graphml [2020-11-29 22:51:57,277 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-11-29 22:51:57,279 INFO L168 Benchmark]: Toolchain (without parser) took 109725.72 ms. Allocated memory was 92.3 MB in the beginning and 408.9 MB in the end (delta: 316.7 MB). Free memory was 61.1 MB in the beginning and 339.3 MB in the end (delta: -278.2 MB). Peak memory consumption was 39.5 MB. Max. memory is 16.1 GB. [2020-11-29 22:51:57,279 INFO L168 Benchmark]: CDTParser took 0.36 ms. Allocated memory is still 92.3 MB. Free memory is still 51.5 MB. There was no memory consumed. Max. memory is 16.1 GB. [2020-11-29 22:51:57,280 INFO L168 Benchmark]: CACSL2BoogieTranslator took 616.63 ms. Allocated memory is still 92.3 MB. Free memory was 60.8 MB in the beginning and 59.1 MB in the end (delta: 1.7 MB). Peak memory consumption was 10.5 MB. Max. memory is 16.1 GB. [2020-11-29 22:51:57,280 INFO L168 Benchmark]: Boogie Preprocessor took 126.50 ms. Allocated memory is still 92.3 MB. Free memory was 59.1 MB in the beginning and 55.5 MB in the end (delta: 3.6 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2020-11-29 22:51:57,280 INFO L168 Benchmark]: RCFGBuilder took 1499.01 ms. Allocated memory was 92.3 MB in the beginning and 127.9 MB in the end (delta: 35.7 MB). Free memory was 55.5 MB in the beginning and 80.6 MB in the end (delta: -25.1 MB). Peak memory consumption was 37.7 MB. Max. memory is 16.1 GB. [2020-11-29 22:51:57,281 INFO L168 Benchmark]: TraceAbstraction took 107283.90 ms. Allocated memory was 127.9 MB in the beginning and 408.9 MB in the end (delta: 281.0 MB). Free memory was 80.6 MB in the beginning and 358.2 MB in the end (delta: -277.6 MB). Peak memory consumption was 4.5 MB. Max. memory is 16.1 GB. [2020-11-29 22:51:57,281 INFO L168 Benchmark]: Witness Printer took 189.36 ms. Allocated memory is still 408.9 MB. Free memory was 358.2 MB in the beginning and 339.3 MB in the end (delta: 18.9 MB). Peak memory consumption was 18.9 MB. Max. memory is 16.1 GB. [2020-11-29 22:51:57,283 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.36 ms. Allocated memory is still 92.3 MB. Free memory is still 51.5 MB. There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 616.63 ms. Allocated memory is still 92.3 MB. Free memory was 60.8 MB in the beginning and 59.1 MB in the end (delta: 1.7 MB). Peak memory consumption was 10.5 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 126.50 ms. Allocated memory is still 92.3 MB. Free memory was 59.1 MB in the beginning and 55.5 MB in the end (delta: 3.6 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * RCFGBuilder took 1499.01 ms. Allocated memory was 92.3 MB in the beginning and 127.9 MB in the end (delta: 35.7 MB). Free memory was 55.5 MB in the beginning and 80.6 MB in the end (delta: -25.1 MB). Peak memory consumption was 37.7 MB. Max. memory is 16.1 GB. * TraceAbstraction took 107283.90 ms. Allocated memory was 127.9 MB in the beginning and 408.9 MB in the end (delta: 281.0 MB). Free memory was 80.6 MB in the beginning and 358.2 MB in the end (delta: -277.6 MB). Peak memory consumption was 4.5 MB. Max. memory is 16.1 GB. * Witness Printer took 189.36 ms. Allocated memory is still 408.9 MB. Free memory was 358.2 MB in the beginning and 339.3 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: - PositiveResult [Line: 3]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - PositiveResult [Line: 670]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - AllSpecificationsHoldResult: All specifications hold 2 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 28 procedures, 314 locations, 2 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 107.2s, OverallIterations: 53, TraceHistogramMax: 2, AutomataDifference: 81.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 15937 SDtfs, 20467 SDslu, 34941 SDs, 0 SdLazy, 61078 SolverSat, 6947 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 56.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1569 GetRequests, 712 SyntacticMatches, 1 SemanticMatches, 856 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2913 ImplicationChecksByTransitivity, 30.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1148occurred in iteration=39, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.0s AutomataMinimizationTime, 53 MinimizatonAttempts, 2488 StatesRemovedByMinimization, 51 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.9s SatisfiabilityAnalysisTime, 22.3s InterpolantComputationTime, 4039 NumberOfCodeBlocks, 4039 NumberOfCodeBlocksAsserted, 53 NumberOfCheckSat, 3986 ConstructedInterpolants, 0 QuantifiedInterpolants, 1499971 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 53 InterpolantComputations, 53 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 RESULT: Ultimate proved your program to be correct! Received shutdown request...