./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/ntdrivers-simplified/diskperf_simpl1.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version a4ecdabc Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_27253434-b648-4f77-a9cd-bcc7a4e89299/bin/uautomizer/data/config -Xmx15G -Xms4m -jar /tmp/vcloud-vcloud-master/worker/run_dir_27253434-b648-4f77-a9cd-bcc7a4e89299/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_27253434-b648-4f77-a9cd-bcc7a4e89299/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_27253434-b648-4f77-a9cd-bcc7a4e89299/bin/uautomizer/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/ntdrivers-simplified/diskperf_simpl1.cil.c -s /tmp/vcloud-vcloud-master/worker/run_dir_27253434-b648-4f77-a9cd-bcc7a4e89299/bin/uautomizer/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_27253434-b648-4f77-a9cd-bcc7a4e89299/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 4df6794b9b3a948996212d63f7c149439c613ff1 ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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 23:31:39,312 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-11-29 23:31:39,315 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-11-29 23:31:39,380 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-11-29 23:31:39,381 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-11-29 23:31:39,386 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-11-29 23:31:39,389 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-11-29 23:31:39,393 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-11-29 23:31:39,396 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-11-29 23:31:39,402 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-11-29 23:31:39,424 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-11-29 23:31:39,426 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-11-29 23:31:39,427 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-11-29 23:31:39,428 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-11-29 23:31:39,429 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-11-29 23:31:39,431 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-11-29 23:31:39,433 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-11-29 23:31:39,435 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-11-29 23:31:39,437 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-11-29 23:31:39,440 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-11-29 23:31:39,442 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-11-29 23:31:39,443 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-11-29 23:31:39,445 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-11-29 23:31:39,446 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-11-29 23:31:39,450 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-11-29 23:31:39,450 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-11-29 23:31:39,451 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-11-29 23:31:39,452 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-11-29 23:31:39,453 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-11-29 23:31:39,454 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-11-29 23:31:39,455 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-11-29 23:31:39,456 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-11-29 23:31:39,457 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-11-29 23:31:39,458 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-11-29 23:31:39,460 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-11-29 23:31:39,460 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-11-29 23:31:39,461 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-11-29 23:31:39,461 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-11-29 23:31:39,462 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-11-29 23:31:39,463 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-11-29 23:31:39,464 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-11-29 23:31:39,465 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_27253434-b648-4f77-a9cd-bcc7a4e89299/bin/uautomizer/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2020-11-29 23:31:39,498 INFO L113 SettingsManager]: Loading preferences was successful [2020-11-29 23:31:39,499 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-11-29 23:31:39,501 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-11-29 23:31:39,501 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-11-29 23:31:39,501 INFO L138 SettingsManager]: * Use SBE=true [2020-11-29 23:31:39,502 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-11-29 23:31:39,502 INFO L138 SettingsManager]: * sizeof long=4 [2020-11-29 23:31:39,502 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2020-11-29 23:31:39,503 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-11-29 23:31:39,503 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-11-29 23:31:39,504 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-11-29 23:31:39,504 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2020-11-29 23:31:39,505 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2020-11-29 23:31:39,505 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2020-11-29 23:31:39,505 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-11-29 23:31:39,505 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2020-11-29 23:31:39,506 INFO L138 SettingsManager]: * sizeof long double=12 [2020-11-29 23:31:39,506 INFO L138 SettingsManager]: * Use constant arrays=true [2020-11-29 23:31:39,506 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-11-29 23:31:39,507 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-11-29 23:31:39,507 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-11-29 23:31:39,507 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-11-29 23:31:39,507 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-11-29 23:31:39,508 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-11-29 23:31:39,508 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-11-29 23:31:39,508 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-11-29 23:31:39,509 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-11-29 23:31:39,509 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-11-29 23:31:39,509 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_27253434-b648-4f77-a9cd-bcc7a4e89299/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_27253434-b648-4f77-a9cd-bcc7a4e89299/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 -> 4df6794b9b3a948996212d63f7c149439c613ff1 [2020-11-29 23:31:39,881 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-11-29 23:31:39,923 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-11-29 23:31:39,926 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-11-29 23:31:39,927 INFO L271 PluginConnector]: Initializing CDTParser... [2020-11-29 23:31:39,929 INFO L275 PluginConnector]: CDTParser initialized [2020-11-29 23:31:39,930 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_27253434-b648-4f77-a9cd-bcc7a4e89299/bin/uautomizer/../../sv-benchmarks/c/ntdrivers-simplified/diskperf_simpl1.cil.c [2020-11-29 23:31:40,032 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_27253434-b648-4f77-a9cd-bcc7a4e89299/bin/uautomizer/data/1d0b06cae/485561ed0e68451c8479fdb1c4472820/FLAG368d2506c [2020-11-29 23:31:40,748 INFO L306 CDTParser]: Found 1 translation units. [2020-11-29 23:31:40,752 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_27253434-b648-4f77-a9cd-bcc7a4e89299/sv-benchmarks/c/ntdrivers-simplified/diskperf_simpl1.cil.c [2020-11-29 23:31:40,775 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_27253434-b648-4f77-a9cd-bcc7a4e89299/bin/uautomizer/data/1d0b06cae/485561ed0e68451c8479fdb1c4472820/FLAG368d2506c [2020-11-29 23:31:41,006 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_27253434-b648-4f77-a9cd-bcc7a4e89299/bin/uautomizer/data/1d0b06cae/485561ed0e68451c8479fdb1c4472820 [2020-11-29 23:31:41,010 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-11-29 23:31:41,012 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2020-11-29 23:31:41,016 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-11-29 23:31:41,017 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-11-29 23:31:41,021 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-11-29 23:31:41,022 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 11:31:41" (1/1) ... [2020-11-29 23:31:41,024 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6a33560d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 11:31:41, skipping insertion in model container [2020-11-29 23:31:41,025 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 11:31:41" (1/1) ... [2020-11-29 23:31:41,032 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-11-29 23:31:41,117 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-11-29 23:31:41,535 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-11-29 23:31:41,559 INFO L203 MainTranslator]: Completed pre-run [2020-11-29 23:31:41,654 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-11-29 23:31:41,681 INFO L208 MainTranslator]: Completed translation [2020-11-29 23:31:41,682 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 11:31:41 WrapperNode [2020-11-29 23:31:41,682 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-11-29 23:31:41,683 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-11-29 23:31:41,684 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-11-29 23:31:41,684 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-11-29 23:31:41,696 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 11:31:41" (1/1) ... [2020-11-29 23:31:41,697 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 11:31:41" (1/1) ... [2020-11-29 23:31:41,714 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 11:31:41" (1/1) ... [2020-11-29 23:31:41,714 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 11:31:41" (1/1) ... [2020-11-29 23:31:41,746 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 11:31:41" (1/1) ... [2020-11-29 23:31:41,773 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 11:31:41" (1/1) ... [2020-11-29 23:31:41,784 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 11:31:41" (1/1) ... [2020-11-29 23:31:41,791 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-11-29 23:31:41,807 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-11-29 23:31:41,808 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-11-29 23:31:41,808 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-11-29 23:31:41,809 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 11:31:41" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_27253434-b648-4f77-a9cd-bcc7a4e89299/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 23:31:41,880 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-11-29 23:31:41,881 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-11-29 23:31:41,881 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2020-11-29 23:31:41,881 INFO L138 BoogieDeclarations]: Found implementation of procedure errorFn [2020-11-29 23:31:41,881 INFO L138 BoogieDeclarations]: Found implementation of procedure _BLAST_init [2020-11-29 23:31:41,881 INFO L138 BoogieDeclarations]: Found implementation of procedure DiskPerfSyncFilterWithTarget [2020-11-29 23:31:41,882 INFO L138 BoogieDeclarations]: Found implementation of procedure DiskPerfDispatchPnp [2020-11-29 23:31:41,882 INFO L138 BoogieDeclarations]: Found implementation of procedure DiskPerfIrpCompletion [2020-11-29 23:31:41,882 INFO L138 BoogieDeclarations]: Found implementation of procedure DiskPerfStartDevice [2020-11-29 23:31:41,882 INFO L138 BoogieDeclarations]: Found implementation of procedure DiskPerfRemoveDevice [2020-11-29 23:31:41,883 INFO L138 BoogieDeclarations]: Found implementation of procedure DiskPerfSendToNextDriver [2020-11-29 23:31:41,883 INFO L138 BoogieDeclarations]: Found implementation of procedure DiskPerfDispatchPower [2020-11-29 23:31:41,883 INFO L138 BoogieDeclarations]: Found implementation of procedure DiskPerfForwardIrpSynchronous [2020-11-29 23:31:41,883 INFO L138 BoogieDeclarations]: Found implementation of procedure DiskPerfCreate [2020-11-29 23:31:41,884 INFO L138 BoogieDeclarations]: Found implementation of procedure DiskPerfIoCompletion [2020-11-29 23:31:41,884 INFO L138 BoogieDeclarations]: Found implementation of procedure DiskPerfDeviceControl [2020-11-29 23:31:41,884 INFO L138 BoogieDeclarations]: Found implementation of procedure DiskPerfShutdownFlush [2020-11-29 23:31:41,884 INFO L138 BoogieDeclarations]: Found implementation of procedure DiskPerfUnload [2020-11-29 23:31:41,885 INFO L138 BoogieDeclarations]: Found implementation of procedure DiskPerfRegisterDevice [2020-11-29 23:31:41,885 INFO L138 BoogieDeclarations]: Found implementation of procedure stub_driver_init [2020-11-29 23:31:41,885 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-11-29 23:31:41,885 INFO L138 BoogieDeclarations]: Found implementation of procedure IoBuildDeviceIoControlRequest [2020-11-29 23:31:41,886 INFO L138 BoogieDeclarations]: Found implementation of procedure stubMoreProcessingRequired [2020-11-29 23:31:41,886 INFO L138 BoogieDeclarations]: Found implementation of procedure IofCallDriver [2020-11-29 23:31:41,886 INFO L138 BoogieDeclarations]: Found implementation of procedure IofCompleteRequest [2020-11-29 23:31:41,886 INFO L138 BoogieDeclarations]: Found implementation of procedure KeSetEvent [2020-11-29 23:31:41,887 INFO L138 BoogieDeclarations]: Found implementation of procedure KeWaitForSingleObject [2020-11-29 23:31:41,887 INFO L138 BoogieDeclarations]: Found implementation of procedure PoCallDriver [2020-11-29 23:31:41,887 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2020-11-29 23:31:41,887 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2020-11-29 23:31:41,888 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2020-11-29 23:31:41,888 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-11-29 23:31:41,888 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2020-11-29 23:31:41,888 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-11-29 23:31:41,888 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_long [2020-11-29 23:31:41,889 INFO L130 BoogieDeclarations]: Found specification of procedure DiskPerfDispatchPnp [2020-11-29 23:31:41,889 INFO L130 BoogieDeclarations]: Found specification of procedure DiskPerfIrpCompletion [2020-11-29 23:31:41,889 INFO L130 BoogieDeclarations]: Found specification of procedure DiskPerfStartDevice [2020-11-29 23:31:41,889 INFO L130 BoogieDeclarations]: Found specification of procedure DiskPerfRemoveDevice [2020-11-29 23:31:41,889 INFO L130 BoogieDeclarations]: Found specification of procedure DiskPerfSendToNextDriver [2020-11-29 23:31:41,890 INFO L130 BoogieDeclarations]: Found specification of procedure DiskPerfDispatchPower [2020-11-29 23:31:41,890 INFO L130 BoogieDeclarations]: Found specification of procedure DiskPerfForwardIrpSynchronous [2020-11-29 23:31:41,890 INFO L130 BoogieDeclarations]: Found specification of procedure DiskPerfCreate [2020-11-29 23:31:41,890 INFO L130 BoogieDeclarations]: Found specification of procedure DiskPerfIoCompletion [2020-11-29 23:31:41,890 INFO L130 BoogieDeclarations]: Found specification of procedure DiskPerfDeviceControl [2020-11-29 23:31:41,891 INFO L130 BoogieDeclarations]: Found specification of procedure DiskPerfShutdownFlush [2020-11-29 23:31:41,891 INFO L130 BoogieDeclarations]: Found specification of procedure DiskPerfRegisterDevice [2020-11-29 23:31:41,891 INFO L130 BoogieDeclarations]: Found specification of procedure IoBuildDeviceIoControlRequest [2020-11-29 23:31:41,891 INFO L130 BoogieDeclarations]: Found specification of procedure IofCallDriver [2020-11-29 23:31:41,892 INFO L130 BoogieDeclarations]: Found specification of procedure KeSetEvent [2020-11-29 23:31:41,892 INFO L130 BoogieDeclarations]: Found specification of procedure KeWaitForSingleObject [2020-11-29 23:31:41,892 INFO L130 BoogieDeclarations]: Found specification of procedure PoCallDriver [2020-11-29 23:31:41,892 INFO L130 BoogieDeclarations]: Found specification of procedure IofCompleteRequest [2020-11-29 23:31:41,892 INFO L130 BoogieDeclarations]: Found specification of procedure errorFn [2020-11-29 23:31:41,893 INFO L130 BoogieDeclarations]: Found specification of procedure _BLAST_init [2020-11-29 23:31:41,893 INFO L130 BoogieDeclarations]: Found specification of procedure DiskPerfSyncFilterWithTarget [2020-11-29 23:31:41,893 INFO L130 BoogieDeclarations]: Found specification of procedure DiskPerfUnload [2020-11-29 23:31:41,893 INFO L130 BoogieDeclarations]: Found specification of procedure stub_driver_init [2020-11-29 23:31:41,894 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-11-29 23:31:41,894 INFO L130 BoogieDeclarations]: Found specification of procedure stubMoreProcessingRequired [2020-11-29 23:31:41,894 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-11-29 23:31:41,894 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-11-29 23:31:41,894 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-11-29 23:31:41,895 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-11-29 23:31:41,895 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-11-29 23:31:41,895 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-11-29 23:31:42,435 WARN L798 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2020-11-29 23:31:42,646 INFO L751 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##18: assume false; [2020-11-29 23:31:42,647 INFO L751 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##19: assume !false; [2020-11-29 23:31:42,662 WARN L798 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2020-11-29 23:31:42,743 INFO L751 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##18: assume !false; [2020-11-29 23:31:42,743 INFO L751 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##17: assume false; [2020-11-29 23:31:42,769 WARN L798 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2020-11-29 23:31:42,812 INFO L751 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##16: assume !false; [2020-11-29 23:31:42,812 INFO L751 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##15: assume false; [2020-11-29 23:31:42,821 WARN L798 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2020-11-29 23:31:42,838 INFO L751 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !false; [2020-11-29 23:31:42,838 INFO L751 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume false; [2020-11-29 23:31:43,193 WARN L798 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2020-11-29 23:31:43,259 INFO L751 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##15: assume !false; [2020-11-29 23:31:43,259 INFO L751 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##14: assume false; [2020-11-29 23:31:43,308 WARN L798 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2020-11-29 23:31:43,339 INFO L751 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##6: assume !false; [2020-11-29 23:31:43,339 INFO L751 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##5: assume false; [2020-11-29 23:31:43,413 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-11-29 23:31:43,413 INFO L298 CfgBuilder]: Removed 1 assume(true) statements. [2020-11-29 23:31:43,415 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 11:31:43 BoogieIcfgContainer [2020-11-29 23:31:43,415 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-11-29 23:31:43,417 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-11-29 23:31:43,417 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-11-29 23:31:43,421 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-11-29 23:31:43,421 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.11 11:31:41" (1/3) ... [2020-11-29 23:31:43,422 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@14e2f54a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 11:31:43, skipping insertion in model container [2020-11-29 23:31:43,422 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 11:31:41" (2/3) ... [2020-11-29 23:31:43,422 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@14e2f54a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 11:31:43, skipping insertion in model container [2020-11-29 23:31:43,423 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 11:31:43" (3/3) ... [2020-11-29 23:31:43,424 INFO L111 eAbstractionObserver]: Analyzing ICFG diskperf_simpl1.cil.c [2020-11-29 23:31:43,436 INFO L164 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-11-29 23:31:43,440 INFO L176 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2020-11-29 23:31:43,453 INFO L253 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2020-11-29 23:31:43,473 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-11-29 23:31:43,474 INFO L378 AbstractCegarLoop]: Hoare is false [2020-11-29 23:31:43,474 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-11-29 23:31:43,474 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-11-29 23:31:43,474 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-11-29 23:31:43,474 INFO L382 AbstractCegarLoop]: Difference is false [2020-11-29 23:31:43,474 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-11-29 23:31:43,474 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-11-29 23:31:43,498 INFO L276 IsEmpty]: Start isEmpty. Operand 300 states. [2020-11-29 23:31:43,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-11-29 23:31:43,506 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 23:31:43,507 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-29 23:31:43,507 INFO L429 AbstractCegarLoop]: === Iteration 1 === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr0ENSURES_VIOLATIONMEMORY_LEAK]=== [2020-11-29 23:31:43,513 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 23:31:43,513 INFO L82 PathProgramCache]: Analyzing trace with hash 2110575964, now seen corresponding path program 1 times [2020-11-29 23:31:43,526 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 23:31:43,526 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [47275706] [2020-11-29 23:31:43,527 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 23:31:43,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 23:31:43,921 WARN L193 SmtUtils]: Spent 174.00 ms on a formula simplification that was a NOOP. DAG size: 91 [2020-11-29 23:31:43,923 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-29 23:31:43,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 23:31:44,049 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-11-29 23:31:44,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 23:31:44,073 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 23:31:44,083 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [47275706] [2020-11-29 23:31:44,084 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-29 23:31:44,085 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-29 23:31:44,086 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1961987265] [2020-11-29 23:31:44,090 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-29 23:31:44,091 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 23:31:44,108 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-29 23:31:44,113 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-11-29 23:31:44,115 INFO L87 Difference]: Start difference. First operand 300 states. Second operand 4 states. [2020-11-29 23:31:45,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 23:31:45,717 INFO L93 Difference]: Finished difference Result 333 states and 460 transitions. [2020-11-29 23:31:45,718 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-11-29 23:31:45,719 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2020-11-29 23:31:45,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 23:31:45,744 INFO L225 Difference]: With dead ends: 333 [2020-11-29 23:31:45,747 INFO L226 Difference]: Without dead ends: 327 [2020-11-29 23:31:45,749 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 23:31:45,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 327 states. [2020-11-29 23:31:45,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 327 to 288. [2020-11-29 23:31:45,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 288 states. [2020-11-29 23:31:45,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 288 states to 288 states and 385 transitions. [2020-11-29 23:31:45,876 INFO L78 Accepts]: Start accepts. Automaton has 288 states and 385 transitions. Word has length 15 [2020-11-29 23:31:45,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 23:31:45,877 INFO L481 AbstractCegarLoop]: Abstraction has 288 states and 385 transitions. [2020-11-29 23:31:45,877 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-29 23:31:45,877 INFO L276 IsEmpty]: Start isEmpty. Operand 288 states and 385 transitions. [2020-11-29 23:31:45,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-11-29 23:31:45,879 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 23:31:45,879 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 23:31:45,879 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-11-29 23:31:45,879 INFO L429 AbstractCegarLoop]: === Iteration 2 === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr0ENSURES_VIOLATIONMEMORY_LEAK]=== [2020-11-29 23:31:45,880 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 23:31:45,881 INFO L82 PathProgramCache]: Analyzing trace with hash 1358878168, now seen corresponding path program 1 times [2020-11-29 23:31:45,886 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 23:31:45,886 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2064698222] [2020-11-29 23:31:45,887 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 23:31:45,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 23:31:46,109 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-29 23:31:46,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 23:31:46,187 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-11-29 23:31:46,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 23:31:46,211 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 23:31:46,213 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2064698222] [2020-11-29 23:31:46,213 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-29 23:31:46,213 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-11-29 23:31:46,214 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1487254538] [2020-11-29 23:31:46,216 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-11-29 23:31:46,217 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 23:31:46,217 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-11-29 23:31:46,218 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-11-29 23:31:46,218 INFO L87 Difference]: Start difference. First operand 288 states and 385 transitions. Second operand 5 states. [2020-11-29 23:31:47,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 23:31:47,637 INFO L93 Difference]: Finished difference Result 332 states and 452 transitions. [2020-11-29 23:31:47,638 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-11-29 23:31:47,638 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 21 [2020-11-29 23:31:47,638 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 23:31:47,643 INFO L225 Difference]: With dead ends: 332 [2020-11-29 23:31:47,643 INFO L226 Difference]: Without dead ends: 327 [2020-11-29 23:31:47,643 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2020-11-29 23:31:47,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 327 states. [2020-11-29 23:31:47,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 327 to 288. [2020-11-29 23:31:47,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 288 states. [2020-11-29 23:31:47,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 288 states to 288 states and 384 transitions. [2020-11-29 23:31:47,683 INFO L78 Accepts]: Start accepts. Automaton has 288 states and 384 transitions. Word has length 21 [2020-11-29 23:31:47,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 23:31:47,683 INFO L481 AbstractCegarLoop]: Abstraction has 288 states and 384 transitions. [2020-11-29 23:31:47,683 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-11-29 23:31:47,683 INFO L276 IsEmpty]: Start isEmpty. Operand 288 states and 384 transitions. [2020-11-29 23:31:47,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2020-11-29 23:31:47,685 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 23:31:47,686 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] [2020-11-29 23:31:47,686 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-11-29 23:31:47,686 INFO L429 AbstractCegarLoop]: === Iteration 3 === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr0ENSURES_VIOLATIONMEMORY_LEAK]=== [2020-11-29 23:31:47,686 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 23:31:47,687 INFO L82 PathProgramCache]: Analyzing trace with hash 1814240153, now seen corresponding path program 1 times [2020-11-29 23:31:47,687 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 23:31:47,687 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [830261682] [2020-11-29 23:31:47,687 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 23:31:47,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 23:31:47,914 WARN L193 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 91 [2020-11-29 23:31:47,915 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-29 23:31:47,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 23:31:47,974 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-11-29 23:31:47,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 23:31:48,004 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-11-29 23:31:48,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 23:31:48,014 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 23:31:48,014 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [830261682] [2020-11-29 23:31:48,014 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-29 23:31:48,015 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-11-29 23:31:48,015 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1845593624] [2020-11-29 23:31:48,015 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-11-29 23:31:48,016 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 23:31:48,016 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-11-29 23:31:48,017 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-11-29 23:31:48,018 INFO L87 Difference]: Start difference. First operand 288 states and 384 transitions. Second operand 6 states. [2020-11-29 23:31:50,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 23:31:50,835 INFO L93 Difference]: Finished difference Result 510 states and 704 transitions. [2020-11-29 23:31:50,836 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-11-29 23:31:50,836 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 26 [2020-11-29 23:31:50,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 23:31:50,844 INFO L225 Difference]: With dead ends: 510 [2020-11-29 23:31:50,844 INFO L226 Difference]: Without dead ends: 509 [2020-11-29 23:31:50,845 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2020-11-29 23:31:50,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 509 states. [2020-11-29 23:31:50,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 509 to 441. [2020-11-29 23:31:50,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 441 states. [2020-11-29 23:31:50,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 441 states to 441 states and 609 transitions. [2020-11-29 23:31:50,896 INFO L78 Accepts]: Start accepts. Automaton has 441 states and 609 transitions. Word has length 26 [2020-11-29 23:31:50,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 23:31:50,896 INFO L481 AbstractCegarLoop]: Abstraction has 441 states and 609 transitions. [2020-11-29 23:31:50,896 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-11-29 23:31:50,897 INFO L276 IsEmpty]: Start isEmpty. Operand 441 states and 609 transitions. [2020-11-29 23:31:50,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2020-11-29 23:31:50,903 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 23:31:50,903 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] [2020-11-29 23:31:50,903 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-11-29 23:31:50,904 INFO L429 AbstractCegarLoop]: === Iteration 4 === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr0ENSURES_VIOLATIONMEMORY_LEAK]=== [2020-11-29 23:31:50,905 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 23:31:50,906 INFO L82 PathProgramCache]: Analyzing trace with hash 766746196, now seen corresponding path program 1 times [2020-11-29 23:31:50,906 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 23:31:50,906 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1284487347] [2020-11-29 23:31:50,907 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 23:31:50,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 23:31:51,126 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-29 23:31:51,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 23:31:51,193 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-11-29 23:31:51,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 23:31:51,236 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-11-29 23:31:51,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 23:31:51,250 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 23:31:51,250 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1284487347] [2020-11-29 23:31:51,251 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-29 23:31:51,253 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-11-29 23:31:51,257 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [525224166] [2020-11-29 23:31:51,258 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-11-29 23:31:51,259 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 23:31:51,259 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-11-29 23:31:51,260 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-11-29 23:31:51,260 INFO L87 Difference]: Start difference. First operand 441 states and 609 transitions. Second operand 6 states. [2020-11-29 23:31:53,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 23:31:53,486 INFO L93 Difference]: Finished difference Result 692 states and 981 transitions. [2020-11-29 23:31:53,488 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-11-29 23:31:53,488 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 32 [2020-11-29 23:31:53,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 23:31:53,495 INFO L225 Difference]: With dead ends: 692 [2020-11-29 23:31:53,495 INFO L226 Difference]: Without dead ends: 692 [2020-11-29 23:31:53,500 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2020-11-29 23:31:53,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 692 states. [2020-11-29 23:31:53,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 692 to 619. [2020-11-29 23:31:53,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 619 states. [2020-11-29 23:31:53,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 619 states to 619 states and 889 transitions. [2020-11-29 23:31:53,578 INFO L78 Accepts]: Start accepts. Automaton has 619 states and 889 transitions. Word has length 32 [2020-11-29 23:31:53,579 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 23:31:53,579 INFO L481 AbstractCegarLoop]: Abstraction has 619 states and 889 transitions. [2020-11-29 23:31:53,579 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-11-29 23:31:53,579 INFO L276 IsEmpty]: Start isEmpty. Operand 619 states and 889 transitions. [2020-11-29 23:31:53,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2020-11-29 23:31:53,588 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 23:31:53,589 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] [2020-11-29 23:31:53,589 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-11-29 23:31:53,589 INFO L429 AbstractCegarLoop]: === Iteration 5 === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr0ENSURES_VIOLATIONMEMORY_LEAK]=== [2020-11-29 23:31:53,590 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 23:31:53,590 INFO L82 PathProgramCache]: Analyzing trace with hash -898482576, now seen corresponding path program 1 times [2020-11-29 23:31:53,590 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 23:31:53,590 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2041262910] [2020-11-29 23:31:53,591 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 23:31:53,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 23:31:53,805 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-29 23:31:53,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 23:31:53,854 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-11-29 23:31:53,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 23:31:53,887 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-11-29 23:31:53,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 23:31:53,896 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 23:31:53,896 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2041262910] [2020-11-29 23:31:53,897 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-29 23:31:53,897 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-11-29 23:31:53,897 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1925811193] [2020-11-29 23:31:53,898 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-11-29 23:31:53,898 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 23:31:53,899 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-11-29 23:31:53,900 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-11-29 23:31:53,900 INFO L87 Difference]: Start difference. First operand 619 states and 889 transitions. Second operand 6 states. [2020-11-29 23:31:55,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 23:31:55,460 INFO L93 Difference]: Finished difference Result 662 states and 948 transitions. [2020-11-29 23:31:55,463 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-11-29 23:31:55,463 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 37 [2020-11-29 23:31:55,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 23:31:55,471 INFO L225 Difference]: With dead ends: 662 [2020-11-29 23:31:55,472 INFO L226 Difference]: Without dead ends: 662 [2020-11-29 23:31:55,472 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2020-11-29 23:31:55,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 662 states. [2020-11-29 23:31:55,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 662 to 629. [2020-11-29 23:31:55,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 629 states. [2020-11-29 23:31:55,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 629 states to 629 states and 902 transitions. [2020-11-29 23:31:55,516 INFO L78 Accepts]: Start accepts. Automaton has 629 states and 902 transitions. Word has length 37 [2020-11-29 23:31:55,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 23:31:55,517 INFO L481 AbstractCegarLoop]: Abstraction has 629 states and 902 transitions. [2020-11-29 23:31:55,517 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-11-29 23:31:55,517 INFO L276 IsEmpty]: Start isEmpty. Operand 629 states and 902 transitions. [2020-11-29 23:31:55,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2020-11-29 23:31:55,520 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 23:31:55,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] [2020-11-29 23:31:55,521 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-11-29 23:31:55,521 INFO L429 AbstractCegarLoop]: === Iteration 6 === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr0ENSURES_VIOLATIONMEMORY_LEAK]=== [2020-11-29 23:31:55,522 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 23:31:55,522 INFO L82 PathProgramCache]: Analyzing trace with hash -1572700989, now seen corresponding path program 1 times [2020-11-29 23:31:55,522 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 23:31:55,522 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [752386886] [2020-11-29 23:31:55,522 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 23:31:55,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 23:31:55,734 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-29 23:31:55,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 23:31:55,797 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-11-29 23:31:55,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 23:31:55,847 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-11-29 23:31:55,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 23:31:55,867 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2020-11-29 23:31:55,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 23:31:55,934 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-11-29 23:31:55,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 23:31:55,972 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 23:31:55,972 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [752386886] [2020-11-29 23:31:55,974 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-29 23:31:55,974 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-11-29 23:31:55,974 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [821480797] [2020-11-29 23:31:55,975 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-11-29 23:31:55,975 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 23:31:55,976 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-11-29 23:31:55,976 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2020-11-29 23:31:55,976 INFO L87 Difference]: Start difference. First operand 629 states and 902 transitions. Second operand 12 states. [2020-11-29 23:31:56,127 WARN L193 SmtUtils]: Spent 103.00 ms on a formula simplification that was a NOOP. DAG size: 93 [2020-11-29 23:31:56,312 WARN L193 SmtUtils]: Spent 127.00 ms on a formula simplification that was a NOOP. DAG size: 95 [2020-11-29 23:31:56,932 WARN L193 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 96 [2020-11-29 23:31:58,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 23:31:58,582 INFO L93 Difference]: Finished difference Result 707 states and 1002 transitions. [2020-11-29 23:31:58,583 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-11-29 23:31:58,583 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 40 [2020-11-29 23:31:58,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 23:31:58,592 INFO L225 Difference]: With dead ends: 707 [2020-11-29 23:31:58,592 INFO L226 Difference]: Without dead ends: 707 [2020-11-29 23:31:58,593 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=89, Invalid=217, Unknown=0, NotChecked=0, Total=306 [2020-11-29 23:31:58,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 707 states. [2020-11-29 23:31:58,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 707 to 659. [2020-11-29 23:31:58,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 659 states. [2020-11-29 23:31:58,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 659 states to 659 states and 937 transitions. [2020-11-29 23:31:58,632 INFO L78 Accepts]: Start accepts. Automaton has 659 states and 937 transitions. Word has length 40 [2020-11-29 23:31:58,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 23:31:58,633 INFO L481 AbstractCegarLoop]: Abstraction has 659 states and 937 transitions. [2020-11-29 23:31:58,633 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-11-29 23:31:58,634 INFO L276 IsEmpty]: Start isEmpty. Operand 659 states and 937 transitions. [2020-11-29 23:31:58,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2020-11-29 23:31:58,637 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 23:31:58,637 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 23:31:58,637 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-11-29 23:31:58,637 INFO L429 AbstractCegarLoop]: === Iteration 7 === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr0ENSURES_VIOLATIONMEMORY_LEAK]=== [2020-11-29 23:31:58,638 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 23:31:58,638 INFO L82 PathProgramCache]: Analyzing trace with hash 2137509456, now seen corresponding path program 1 times [2020-11-29 23:31:58,638 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 23:31:58,639 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1021601615] [2020-11-29 23:31:58,639 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 23:31:58,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 23:31:58,869 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-29 23:31:58,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 23:31:58,924 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-11-29 23:31:58,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 23:31:58,995 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-11-29 23:31:58,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 23:31:59,024 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2020-11-29 23:31:59,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 23:31:59,100 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-11-29 23:31:59,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 23:31:59,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 23:31:59,129 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1021601615] [2020-11-29 23:31:59,136 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-29 23:31:59,136 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-11-29 23:31:59,137 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [316790811] [2020-11-29 23:31:59,137 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-11-29 23:31:59,137 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 23:31:59,138 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-11-29 23:31:59,139 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2020-11-29 23:31:59,139 INFO L87 Difference]: Start difference. First operand 659 states and 937 transitions. Second operand 12 states. [2020-11-29 23:31:59,829 WARN L193 SmtUtils]: Spent 164.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 96 [2020-11-29 23:32:00,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 23:32:00,600 INFO L93 Difference]: Finished difference Result 707 states and 1001 transitions. [2020-11-29 23:32:00,601 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-11-29 23:32:00,601 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 41 [2020-11-29 23:32:00,601 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 23:32:00,607 INFO L225 Difference]: With dead ends: 707 [2020-11-29 23:32:00,608 INFO L226 Difference]: Without dead ends: 707 [2020-11-29 23:32:00,609 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=89, Invalid=217, Unknown=0, NotChecked=0, Total=306 [2020-11-29 23:32:00,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 707 states. [2020-11-29 23:32:00,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 707 to 659. [2020-11-29 23:32:00,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 659 states. [2020-11-29 23:32:00,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 659 states to 659 states and 936 transitions. [2020-11-29 23:32:00,643 INFO L78 Accepts]: Start accepts. Automaton has 659 states and 936 transitions. Word has length 41 [2020-11-29 23:32:00,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 23:32:00,644 INFO L481 AbstractCegarLoop]: Abstraction has 659 states and 936 transitions. [2020-11-29 23:32:00,644 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-11-29 23:32:00,644 INFO L276 IsEmpty]: Start isEmpty. Operand 659 states and 936 transitions. [2020-11-29 23:32:00,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2020-11-29 23:32:00,645 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 23:32:00,646 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 23:32:00,646 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-11-29 23:32:00,646 INFO L429 AbstractCegarLoop]: === Iteration 8 === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr0ENSURES_VIOLATIONMEMORY_LEAK]=== [2020-11-29 23:32:00,647 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 23:32:00,647 INFO L82 PathProgramCache]: Analyzing trace with hash 2134083596, now seen corresponding path program 1 times [2020-11-29 23:32:00,647 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 23:32:00,647 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1867235029] [2020-11-29 23:32:00,648 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 23:32:00,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 23:32:00,817 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-29 23:32:00,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 23:32:00,863 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-11-29 23:32:00,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 23:32:00,895 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-11-29 23:32:00,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 23:32:00,910 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2020-11-29 23:32:00,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 23:32:00,924 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-11-29 23:32:00,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 23:32:00,932 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 23:32:00,932 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1867235029] [2020-11-29 23:32:00,933 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-29 23:32:00,933 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-11-29 23:32:00,933 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [529946786] [2020-11-29 23:32:00,933 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-11-29 23:32:00,934 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 23:32:00,934 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-11-29 23:32:00,935 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2020-11-29 23:32:00,935 INFO L87 Difference]: Start difference. First operand 659 states and 936 transitions. Second operand 8 states. [2020-11-29 23:32:02,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 23:32:02,530 INFO L93 Difference]: Finished difference Result 1188 states and 1743 transitions. [2020-11-29 23:32:02,531 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-11-29 23:32:02,531 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 42 [2020-11-29 23:32:02,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 23:32:02,541 INFO L225 Difference]: With dead ends: 1188 [2020-11-29 23:32:02,541 INFO L226 Difference]: Without dead ends: 1188 [2020-11-29 23:32:02,541 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=42, Invalid=68, Unknown=0, NotChecked=0, Total=110 [2020-11-29 23:32:02,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1188 states. [2020-11-29 23:32:02,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1188 to 1086. [2020-11-29 23:32:02,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1086 states. [2020-11-29 23:32:02,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1086 states to 1086 states and 1603 transitions. [2020-11-29 23:32:02,595 INFO L78 Accepts]: Start accepts. Automaton has 1086 states and 1603 transitions. Word has length 42 [2020-11-29 23:32:02,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 23:32:02,597 INFO L481 AbstractCegarLoop]: Abstraction has 1086 states and 1603 transitions. [2020-11-29 23:32:02,597 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-11-29 23:32:02,598 INFO L276 IsEmpty]: Start isEmpty. Operand 1086 states and 1603 transitions. [2020-11-29 23:32:02,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2020-11-29 23:32:02,600 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 23:32:02,601 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 23:32:02,601 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-11-29 23:32:02,601 INFO L429 AbstractCegarLoop]: === Iteration 9 === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr0ENSURES_VIOLATIONMEMORY_LEAK]=== [2020-11-29 23:32:02,605 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 23:32:02,606 INFO L82 PathProgramCache]: Analyzing trace with hash 1980876008, now seen corresponding path program 1 times [2020-11-29 23:32:02,606 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 23:32:02,611 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [966348897] [2020-11-29 23:32:02,611 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 23:32:02,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 23:32:02,763 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-29 23:32:02,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 23:32:02,814 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-11-29 23:32:02,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 23:32:02,842 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-11-29 23:32:02,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 23:32:02,859 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2020-11-29 23:32:02,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 23:32:02,892 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-11-29 23:32:02,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 23:32:02,900 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 23:32:02,901 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [966348897] [2020-11-29 23:32:02,901 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-29 23:32:02,901 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-11-29 23:32:02,902 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1169079786] [2020-11-29 23:32:02,904 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-11-29 23:32:02,904 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 23:32:02,905 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-11-29 23:32:02,905 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2020-11-29 23:32:02,905 INFO L87 Difference]: Start difference. First operand 1086 states and 1603 transitions. Second operand 10 states. [2020-11-29 23:32:03,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 23:32:03,963 INFO L93 Difference]: Finished difference Result 1168 states and 1722 transitions. [2020-11-29 23:32:03,963 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-11-29 23:32:03,964 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 43 [2020-11-29 23:32:03,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 23:32:03,974 INFO L225 Difference]: With dead ends: 1168 [2020-11-29 23:32:03,975 INFO L226 Difference]: Without dead ends: 1149 [2020-11-29 23:32:03,975 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2020-11-29 23:32:03,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1149 states. [2020-11-29 23:32:04,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1149 to 1079. [2020-11-29 23:32:04,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1079 states. [2020-11-29 23:32:04,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1079 states to 1079 states and 1594 transitions. [2020-11-29 23:32:04,036 INFO L78 Accepts]: Start accepts. Automaton has 1079 states and 1594 transitions. Word has length 43 [2020-11-29 23:32:04,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 23:32:04,036 INFO L481 AbstractCegarLoop]: Abstraction has 1079 states and 1594 transitions. [2020-11-29 23:32:04,036 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-11-29 23:32:04,036 INFO L276 IsEmpty]: Start isEmpty. Operand 1079 states and 1594 transitions. [2020-11-29 23:32:04,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2020-11-29 23:32:04,038 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 23:32:04,038 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 23:32:04,038 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-11-29 23:32:04,038 INFO L429 AbstractCegarLoop]: === Iteration 10 === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr0ENSURES_VIOLATIONMEMORY_LEAK]=== [2020-11-29 23:32:04,039 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 23:32:04,040 INFO L82 PathProgramCache]: Analyzing trace with hash 1406397871, now seen corresponding path program 1 times [2020-11-29 23:32:04,040 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 23:32:04,040 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [791291505] [2020-11-29 23:32:04,040 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 23:32:04,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 23:32:04,194 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-29 23:32:04,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 23:32:04,246 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-11-29 23:32:04,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 23:32:04,277 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-11-29 23:32:04,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 23:32:04,286 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 23:32:04,286 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [791291505] [2020-11-29 23:32:04,286 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-29 23:32:04,286 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-11-29 23:32:04,287 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1786921232] [2020-11-29 23:32:04,287 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-11-29 23:32:04,287 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 23:32:04,288 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-11-29 23:32:04,289 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-11-29 23:32:04,289 INFO L87 Difference]: Start difference. First operand 1079 states and 1594 transitions. Second operand 6 states. [2020-11-29 23:32:05,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 23:32:05,468 INFO L93 Difference]: Finished difference Result 600 states and 852 transitions. [2020-11-29 23:32:05,472 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-11-29 23:32:05,473 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 46 [2020-11-29 23:32:05,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 23:32:05,478 INFO L225 Difference]: With dead ends: 600 [2020-11-29 23:32:05,478 INFO L226 Difference]: Without dead ends: 600 [2020-11-29 23:32:05,479 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 6 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 23:32:05,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 600 states. [2020-11-29 23:32:05,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 600 to 599. [2020-11-29 23:32:05,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 599 states. [2020-11-29 23:32:05,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 599 states to 599 states and 851 transitions. [2020-11-29 23:32:05,506 INFO L78 Accepts]: Start accepts. Automaton has 599 states and 851 transitions. Word has length 46 [2020-11-29 23:32:05,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 23:32:05,506 INFO L481 AbstractCegarLoop]: Abstraction has 599 states and 851 transitions. [2020-11-29 23:32:05,506 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-11-29 23:32:05,507 INFO L276 IsEmpty]: Start isEmpty. Operand 599 states and 851 transitions. [2020-11-29 23:32:05,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2020-11-29 23:32:05,508 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 23:32:05,508 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] [2020-11-29 23:32:05,508 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-11-29 23:32:05,509 INFO L429 AbstractCegarLoop]: === Iteration 11 === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr0ENSURES_VIOLATIONMEMORY_LEAK]=== [2020-11-29 23:32:05,509 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 23:32:05,509 INFO L82 PathProgramCache]: Analyzing trace with hash -428474243, now seen corresponding path program 1 times [2020-11-29 23:32:05,510 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 23:32:05,510 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [585097413] [2020-11-29 23:32:05,510 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 23:32:05,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 23:32:05,669 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-29 23:32:05,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 23:32:05,720 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-11-29 23:32:05,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 23:32:05,749 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-11-29 23:32:05,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 23:32:05,773 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2020-11-29 23:32:05,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 23:32:05,810 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-11-29 23:32:05,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 23:32:05,819 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 23:32:05,820 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [585097413] [2020-11-29 23:32:05,820 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-29 23:32:05,821 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-11-29 23:32:05,821 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1126260539] [2020-11-29 23:32:05,821 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-11-29 23:32:05,822 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 23:32:05,822 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-11-29 23:32:05,822 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2020-11-29 23:32:05,823 INFO L87 Difference]: Start difference. First operand 599 states and 851 transitions. Second operand 10 states. [2020-11-29 23:32:07,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 23:32:07,296 INFO L93 Difference]: Finished difference Result 626 states and 885 transitions. [2020-11-29 23:32:07,297 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-11-29 23:32:07,297 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 47 [2020-11-29 23:32:07,297 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 23:32:07,302 INFO L225 Difference]: With dead ends: 626 [2020-11-29 23:32:07,302 INFO L226 Difference]: Without dead ends: 609 [2020-11-29 23:32:07,302 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2020-11-29 23:32:07,304 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 609 states. [2020-11-29 23:32:07,322 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 609 to 597. [2020-11-29 23:32:07,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 597 states. [2020-11-29 23:32:07,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 597 states to 597 states and 847 transitions. [2020-11-29 23:32:07,327 INFO L78 Accepts]: Start accepts. Automaton has 597 states and 847 transitions. Word has length 47 [2020-11-29 23:32:07,328 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 23:32:07,328 INFO L481 AbstractCegarLoop]: Abstraction has 597 states and 847 transitions. [2020-11-29 23:32:07,328 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-11-29 23:32:07,328 INFO L276 IsEmpty]: Start isEmpty. Operand 597 states and 847 transitions. [2020-11-29 23:32:07,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2020-11-29 23:32:07,329 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 23:32:07,330 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] [2020-11-29 23:32:07,330 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-11-29 23:32:07,330 INFO L429 AbstractCegarLoop]: === Iteration 12 === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr0ENSURES_VIOLATIONMEMORY_LEAK]=== [2020-11-29 23:32:07,331 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 23:32:07,331 INFO L82 PathProgramCache]: Analyzing trace with hash 463467599, now seen corresponding path program 1 times [2020-11-29 23:32:07,331 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 23:32:07,331 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [723069120] [2020-11-29 23:32:07,331 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 23:32:07,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 23:32:07,480 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-29 23:32:07,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 23:32:07,553 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-11-29 23:32:07,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 23:32:07,579 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-11-29 23:32:07,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 23:32:07,601 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2020-11-29 23:32:07,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 23:32:07,655 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-11-29 23:32:07,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 23:32:07,666 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 23:32:07,666 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [723069120] [2020-11-29 23:32:07,666 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-29 23:32:07,666 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-11-29 23:32:07,667 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1627762710] [2020-11-29 23:32:07,668 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-11-29 23:32:07,668 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 23:32:07,668 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-11-29 23:32:07,669 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2020-11-29 23:32:07,669 INFO L87 Difference]: Start difference. First operand 597 states and 847 transitions. Second operand 11 states. [2020-11-29 23:32:08,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 23:32:08,736 INFO L93 Difference]: Finished difference Result 627 states and 885 transitions. [2020-11-29 23:32:08,737 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-11-29 23:32:08,737 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 47 [2020-11-29 23:32:08,737 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 23:32:08,740 INFO L225 Difference]: With dead ends: 627 [2020-11-29 23:32:08,740 INFO L226 Difference]: Without dead ends: 609 [2020-11-29 23:32:08,741 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2020-11-29 23:32:08,742 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 609 states. [2020-11-29 23:32:08,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 609 to 597. [2020-11-29 23:32:08,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 597 states. [2020-11-29 23:32:08,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 597 states to 597 states and 846 transitions. [2020-11-29 23:32:08,764 INFO L78 Accepts]: Start accepts. Automaton has 597 states and 846 transitions. Word has length 47 [2020-11-29 23:32:08,765 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 23:32:08,765 INFO L481 AbstractCegarLoop]: Abstraction has 597 states and 846 transitions. [2020-11-29 23:32:08,765 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-11-29 23:32:08,765 INFO L276 IsEmpty]: Start isEmpty. Operand 597 states and 846 transitions. [2020-11-29 23:32:08,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2020-11-29 23:32:08,766 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 23:32:08,767 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] [2020-11-29 23:32:08,767 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-11-29 23:32:08,767 INFO L429 AbstractCegarLoop]: === Iteration 13 === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr0ENSURES_VIOLATIONMEMORY_LEAK]=== [2020-11-29 23:32:08,767 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 23:32:08,768 INFO L82 PathProgramCache]: Analyzing trace with hash -1466302752, now seen corresponding path program 1 times [2020-11-29 23:32:08,768 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 23:32:08,768 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1644511173] [2020-11-29 23:32:08,768 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 23:32:08,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 23:32:08,932 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-29 23:32:08,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 23:32:08,979 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-11-29 23:32:08,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 23:32:09,005 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-11-29 23:32:09,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 23:32:09,030 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2020-11-29 23:32:09,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 23:32:09,065 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-29 23:32:09,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 23:32:09,076 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 23:32:09,076 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1644511173] [2020-11-29 23:32:09,076 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-29 23:32:09,077 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-11-29 23:32:09,077 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [560412860] [2020-11-29 23:32:09,077 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-11-29 23:32:09,077 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 23:32:09,078 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-11-29 23:32:09,084 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2020-11-29 23:32:09,085 INFO L87 Difference]: Start difference. First operand 597 states and 846 transitions. Second operand 8 states. [2020-11-29 23:32:10,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 23:32:10,729 INFO L93 Difference]: Finished difference Result 828 states and 1227 transitions. [2020-11-29 23:32:10,729 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-11-29 23:32:10,730 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 47 [2020-11-29 23:32:10,730 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 23:32:10,735 INFO L225 Difference]: With dead ends: 828 [2020-11-29 23:32:10,735 INFO L226 Difference]: Without dead ends: 828 [2020-11-29 23:32:10,736 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=35, Invalid=55, Unknown=0, NotChecked=0, Total=90 [2020-11-29 23:32:10,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 828 states. [2020-11-29 23:32:10,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 828 to 666. [2020-11-29 23:32:10,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 666 states. [2020-11-29 23:32:10,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 666 states to 666 states and 949 transitions. [2020-11-29 23:32:10,765 INFO L78 Accepts]: Start accepts. Automaton has 666 states and 949 transitions. Word has length 47 [2020-11-29 23:32:10,766 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 23:32:10,766 INFO L481 AbstractCegarLoop]: Abstraction has 666 states and 949 transitions. [2020-11-29 23:32:10,766 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-11-29 23:32:10,766 INFO L276 IsEmpty]: Start isEmpty. Operand 666 states and 949 transitions. [2020-11-29 23:32:10,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2020-11-29 23:32:10,767 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 23:32:10,767 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] [2020-11-29 23:32:10,768 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-11-29 23:32:10,768 INFO L429 AbstractCegarLoop]: === Iteration 14 === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr0ENSURES_VIOLATIONMEMORY_LEAK]=== [2020-11-29 23:32:10,768 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 23:32:10,768 INFO L82 PathProgramCache]: Analyzing trace with hash 1812880736, now seen corresponding path program 1 times [2020-11-29 23:32:10,769 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 23:32:10,769 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [970304688] [2020-11-29 23:32:10,769 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 23:32:10,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 23:32:10,927 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-29 23:32:10,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 23:32:10,978 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-11-29 23:32:10,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 23:32:10,998 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-11-29 23:32:10,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 23:32:11,016 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2020-11-29 23:32:11,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 23:32:11,042 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 23:32:11,042 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [970304688] [2020-11-29 23:32:11,042 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-29 23:32:11,042 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-11-29 23:32:11,043 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1066911056] [2020-11-29 23:32:11,043 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-11-29 23:32:11,043 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 23:32:11,044 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-11-29 23:32:11,045 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2020-11-29 23:32:11,045 INFO L87 Difference]: Start difference. First operand 666 states and 949 transitions. Second operand 8 states. [2020-11-29 23:32:12,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 23:32:12,469 INFO L93 Difference]: Finished difference Result 464 states and 601 transitions. [2020-11-29 23:32:12,470 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-11-29 23:32:12,470 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 51 [2020-11-29 23:32:12,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 23:32:12,473 INFO L225 Difference]: With dead ends: 464 [2020-11-29 23:32:12,473 INFO L226 Difference]: Without dead ends: 464 [2020-11-29 23:32:12,473 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=45, Invalid=87, Unknown=0, NotChecked=0, Total=132 [2020-11-29 23:32:12,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 464 states. [2020-11-29 23:32:12,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 464 to 442. [2020-11-29 23:32:12,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 442 states. [2020-11-29 23:32:12,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 442 states to 442 states and 579 transitions. [2020-11-29 23:32:12,487 INFO L78 Accepts]: Start accepts. Automaton has 442 states and 579 transitions. Word has length 51 [2020-11-29 23:32:12,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 23:32:12,488 INFO L481 AbstractCegarLoop]: Abstraction has 442 states and 579 transitions. [2020-11-29 23:32:12,488 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-11-29 23:32:12,488 INFO L276 IsEmpty]: Start isEmpty. Operand 442 states and 579 transitions. [2020-11-29 23:32:12,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2020-11-29 23:32:12,489 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 23:32:12,490 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] [2020-11-29 23:32:12,490 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-11-29 23:32:12,490 INFO L429 AbstractCegarLoop]: === Iteration 15 === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr0ENSURES_VIOLATIONMEMORY_LEAK]=== [2020-11-29 23:32:12,490 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 23:32:12,491 INFO L82 PathProgramCache]: Analyzing trace with hash -1347780989, now seen corresponding path program 1 times [2020-11-29 23:32:12,491 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 23:32:12,491 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [613340834] [2020-11-29 23:32:12,492 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 23:32:12,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 23:32:12,633 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-29 23:32:12,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 23:32:12,681 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-11-29 23:32:12,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 23:32:12,709 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-11-29 23:32:12,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 23:32:12,731 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2020-11-29 23:32:12,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 23:32:12,787 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-29 23:32:12,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 23:32:12,828 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 23:32:12,829 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [613340834] [2020-11-29 23:32:12,829 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-29 23:32:12,829 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2020-11-29 23:32:12,829 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1461468978] [2020-11-29 23:32:12,830 INFO L461 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-11-29 23:32:12,830 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 23:32:12,830 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-11-29 23:32:12,831 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2020-11-29 23:32:12,831 INFO L87 Difference]: Start difference. First operand 442 states and 579 transitions. Second operand 13 states. [2020-11-29 23:32:13,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 23:32:13,776 INFO L93 Difference]: Finished difference Result 455 states and 595 transitions. [2020-11-29 23:32:13,777 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-11-29 23:32:13,777 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 48 [2020-11-29 23:32:13,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 23:32:13,779 INFO L225 Difference]: With dead ends: 455 [2020-11-29 23:32:13,780 INFO L226 Difference]: Without dead ends: 454 [2020-11-29 23:32:13,780 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2020-11-29 23:32:13,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 454 states. [2020-11-29 23:32:13,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 454 to 450. [2020-11-29 23:32:13,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 450 states. [2020-11-29 23:32:13,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 450 states to 450 states and 590 transitions. [2020-11-29 23:32:13,794 INFO L78 Accepts]: Start accepts. Automaton has 450 states and 590 transitions. Word has length 48 [2020-11-29 23:32:13,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 23:32:13,794 INFO L481 AbstractCegarLoop]: Abstraction has 450 states and 590 transitions. [2020-11-29 23:32:13,794 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-11-29 23:32:13,795 INFO L276 IsEmpty]: Start isEmpty. Operand 450 states and 590 transitions. [2020-11-29 23:32:13,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2020-11-29 23:32:13,796 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 23:32:13,796 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] [2020-11-29 23:32:13,796 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2020-11-29 23:32:13,796 INFO L429 AbstractCegarLoop]: === Iteration 16 === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr0ENSURES_VIOLATIONMEMORY_LEAK]=== [2020-11-29 23:32:13,796 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 23:32:13,797 INFO L82 PathProgramCache]: Analyzing trace with hash -1356362719, now seen corresponding path program 1 times [2020-11-29 23:32:13,797 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 23:32:13,797 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [685452881] [2020-11-29 23:32:13,797 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 23:32:13,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 23:32:13,926 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-29 23:32:13,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 23:32:13,966 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-11-29 23:32:13,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 23:32:13,989 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-11-29 23:32:13,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 23:32:14,007 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2020-11-29 23:32:14,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 23:32:14,069 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-29 23:32:14,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 23:32:14,113 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 23:32:14,114 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [685452881] [2020-11-29 23:32:14,116 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-29 23:32:14,116 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2020-11-29 23:32:14,116 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [692348117] [2020-11-29 23:32:14,117 INFO L461 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-11-29 23:32:14,117 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 23:32:14,118 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-11-29 23:32:14,118 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2020-11-29 23:32:14,118 INFO L87 Difference]: Start difference. First operand 450 states and 590 transitions. Second operand 13 states. [2020-11-29 23:32:15,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 23:32:15,062 INFO L93 Difference]: Finished difference Result 488 states and 653 transitions. [2020-11-29 23:32:15,062 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-11-29 23:32:15,062 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 48 [2020-11-29 23:32:15,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 23:32:15,065 INFO L225 Difference]: With dead ends: 488 [2020-11-29 23:32:15,065 INFO L226 Difference]: Without dead ends: 473 [2020-11-29 23:32:15,066 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=43, Invalid=167, Unknown=0, NotChecked=0, Total=210 [2020-11-29 23:32:15,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 473 states. [2020-11-29 23:32:15,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 473 to 460. [2020-11-29 23:32:15,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 460 states. [2020-11-29 23:32:15,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 460 states to 460 states and 605 transitions. [2020-11-29 23:32:15,081 INFO L78 Accepts]: Start accepts. Automaton has 460 states and 605 transitions. Word has length 48 [2020-11-29 23:32:15,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 23:32:15,081 INFO L481 AbstractCegarLoop]: Abstraction has 460 states and 605 transitions. [2020-11-29 23:32:15,081 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-11-29 23:32:15,081 INFO L276 IsEmpty]: Start isEmpty. Operand 460 states and 605 transitions. [2020-11-29 23:32:15,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2020-11-29 23:32:15,082 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 23:32:15,083 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] [2020-11-29 23:32:15,083 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2020-11-29 23:32:15,083 INFO L429 AbstractCegarLoop]: === Iteration 17 === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr0ENSURES_VIOLATIONMEMORY_LEAK]=== [2020-11-29 23:32:15,083 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 23:32:15,083 INFO L82 PathProgramCache]: Analyzing trace with hash 1404146288, now seen corresponding path program 1 times [2020-11-29 23:32:15,084 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 23:32:15,084 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [183077376] [2020-11-29 23:32:15,084 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 23:32:15,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 23:32:15,250 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-29 23:32:15,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 23:32:15,303 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-11-29 23:32:15,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 23:32:15,337 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-11-29 23:32:15,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 23:32:15,357 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2020-11-29 23:32:15,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 23:32:15,399 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-29 23:32:15,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 23:32:15,412 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 23:32:15,412 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [183077376] [2020-11-29 23:32:15,413 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-29 23:32:15,413 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-11-29 23:32:15,413 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1259366823] [2020-11-29 23:32:15,413 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-11-29 23:32:15,413 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 23:32:15,414 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-11-29 23:32:15,414 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2020-11-29 23:32:15,414 INFO L87 Difference]: Start difference. First operand 460 states and 605 transitions. Second operand 10 states. [2020-11-29 23:32:16,077 WARN L193 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 96 [2020-11-29 23:32:16,287 WARN L193 SmtUtils]: Spent 107.00 ms on a formula simplification that was a NOOP. DAG size: 97 [2020-11-29 23:32:16,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 23:32:16,872 INFO L93 Difference]: Finished difference Result 593 states and 810 transitions. [2020-11-29 23:32:16,872 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2020-11-29 23:32:16,872 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 49 [2020-11-29 23:32:16,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 23:32:16,875 INFO L225 Difference]: With dead ends: 593 [2020-11-29 23:32:16,875 INFO L226 Difference]: Without dead ends: 578 [2020-11-29 23:32:16,875 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 11 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=105, Invalid=237, Unknown=0, NotChecked=0, Total=342 [2020-11-29 23:32:16,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 578 states. [2020-11-29 23:32:16,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 578 to 445. [2020-11-29 23:32:16,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 445 states. [2020-11-29 23:32:16,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 445 states to 445 states and 584 transitions. [2020-11-29 23:32:16,891 INFO L78 Accepts]: Start accepts. Automaton has 445 states and 584 transitions. Word has length 49 [2020-11-29 23:32:16,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 23:32:16,892 INFO L481 AbstractCegarLoop]: Abstraction has 445 states and 584 transitions. [2020-11-29 23:32:16,892 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-11-29 23:32:16,892 INFO L276 IsEmpty]: Start isEmpty. Operand 445 states and 584 transitions. [2020-11-29 23:32:16,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2020-11-29 23:32:16,893 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 23:32:16,893 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 23:32:16,893 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2020-11-29 23:32:16,894 INFO L429 AbstractCegarLoop]: === Iteration 18 === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr0ENSURES_VIOLATIONMEMORY_LEAK]=== [2020-11-29 23:32:16,894 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 23:32:16,894 INFO L82 PathProgramCache]: Analyzing trace with hash 2032273139, now seen corresponding path program 1 times [2020-11-29 23:32:16,894 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 23:32:16,895 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1636796730] [2020-11-29 23:32:16,895 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 23:32:16,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 23:32:17,012 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-29 23:32:17,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 23:32:17,060 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-11-29 23:32:17,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 23:32:17,089 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-11-29 23:32:17,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 23:32:17,109 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2020-11-29 23:32:17,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 23:32:17,141 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-11-29 23:32:17,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 23:32:17,178 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 23:32:17,179 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1636796730] [2020-11-29 23:32:17,179 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-29 23:32:17,179 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-11-29 23:32:17,179 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1398729320] [2020-11-29 23:32:17,180 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-11-29 23:32:17,180 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 23:32:17,180 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-11-29 23:32:17,181 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2020-11-29 23:32:17,181 INFO L87 Difference]: Start difference. First operand 445 states and 584 transitions. Second operand 12 states. [2020-11-29 23:32:18,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 23:32:18,704 INFO L93 Difference]: Finished difference Result 456 states and 597 transitions. [2020-11-29 23:32:18,704 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-11-29 23:32:18,705 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 50 [2020-11-29 23:32:18,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 23:32:18,707 INFO L225 Difference]: With dead ends: 456 [2020-11-29 23:32:18,708 INFO L226 Difference]: Without dead ends: 428 [2020-11-29 23:32:18,708 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2020-11-29 23:32:18,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 428 states. [2020-11-29 23:32:18,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 428 to 428. [2020-11-29 23:32:18,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 428 states. [2020-11-29 23:32:18,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 428 states to 428 states and 563 transitions. [2020-11-29 23:32:18,724 INFO L78 Accepts]: Start accepts. Automaton has 428 states and 563 transitions. Word has length 50 [2020-11-29 23:32:18,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 23:32:18,724 INFO L481 AbstractCegarLoop]: Abstraction has 428 states and 563 transitions. [2020-11-29 23:32:18,724 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-11-29 23:32:18,724 INFO L276 IsEmpty]: Start isEmpty. Operand 428 states and 563 transitions. [2020-11-29 23:32:18,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2020-11-29 23:32:18,726 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 23:32:18,726 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] [2020-11-29 23:32:18,726 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2020-11-29 23:32:18,726 INFO L429 AbstractCegarLoop]: === Iteration 19 === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr0ENSURES_VIOLATIONMEMORY_LEAK]=== [2020-11-29 23:32:18,727 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 23:32:18,727 INFO L82 PathProgramCache]: Analyzing trace with hash -719547520, now seen corresponding path program 1 times [2020-11-29 23:32:18,727 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 23:32:18,727 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [91121376] [2020-11-29 23:32:18,728 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 23:32:18,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 23:32:18,874 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-29 23:32:18,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 23:32:18,943 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-11-29 23:32:18,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 23:32:18,971 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-11-29 23:32:18,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 23:32:18,996 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2020-11-29 23:32:19,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 23:32:19,082 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2020-11-29 23:32:19,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 23:32:19,092 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 23:32:19,093 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [91121376] [2020-11-29 23:32:19,094 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-29 23:32:19,094 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-11-29 23:32:19,094 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1770339367] [2020-11-29 23:32:19,096 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-11-29 23:32:19,096 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 23:32:19,097 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-11-29 23:32:19,097 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2020-11-29 23:32:19,097 INFO L87 Difference]: Start difference. First operand 428 states and 563 transitions. Second operand 11 states. [2020-11-29 23:32:19,374 WARN L193 SmtUtils]: Spent 102.00 ms on a formula simplification that was a NOOP. DAG size: 95 [2020-11-29 23:32:20,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 23:32:20,007 INFO L93 Difference]: Finished difference Result 454 states and 598 transitions. [2020-11-29 23:32:20,008 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-11-29 23:32:20,008 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 51 [2020-11-29 23:32:20,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 23:32:20,011 INFO L225 Difference]: With dead ends: 454 [2020-11-29 23:32:20,011 INFO L226 Difference]: Without dead ends: 424 [2020-11-29 23:32:20,012 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2020-11-29 23:32:20,014 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 424 states. [2020-11-29 23:32:20,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 424 to 410. [2020-11-29 23:32:20,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 410 states. [2020-11-29 23:32:20,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 410 states to 410 states and 543 transitions. [2020-11-29 23:32:20,028 INFO L78 Accepts]: Start accepts. Automaton has 410 states and 543 transitions. Word has length 51 [2020-11-29 23:32:20,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 23:32:20,028 INFO L481 AbstractCegarLoop]: Abstraction has 410 states and 543 transitions. [2020-11-29 23:32:20,029 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-11-29 23:32:20,029 INFO L276 IsEmpty]: Start isEmpty. Operand 410 states and 543 transitions. [2020-11-29 23:32:20,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2020-11-29 23:32:20,030 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 23:32:20,030 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] [2020-11-29 23:32:20,030 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2020-11-29 23:32:20,031 INFO L429 AbstractCegarLoop]: === Iteration 20 === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr0ENSURES_VIOLATIONMEMORY_LEAK]=== [2020-11-29 23:32:20,031 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 23:32:20,031 INFO L82 PathProgramCache]: Analyzing trace with hash 725871195, now seen corresponding path program 1 times [2020-11-29 23:32:20,031 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 23:32:20,031 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [866846357] [2020-11-29 23:32:20,032 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 23:32:20,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 23:32:20,177 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-29 23:32:20,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 23:32:20,226 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-11-29 23:32:20,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 23:32:20,256 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-11-29 23:32:20,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 23:32:20,278 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2020-11-29 23:32:20,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 23:32:20,344 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-29 23:32:20,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 23:32:20,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 23:32:20,389 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [866846357] [2020-11-29 23:32:20,390 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-29 23:32:20,390 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-11-29 23:32:20,390 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1347219185] [2020-11-29 23:32:20,390 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-11-29 23:32:20,391 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 23:32:20,391 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-11-29 23:32:20,391 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2020-11-29 23:32:20,391 INFO L87 Difference]: Start difference. First operand 410 states and 543 transitions. Second operand 11 states. [2020-11-29 23:32:20,551 WARN L193 SmtUtils]: Spent 108.00 ms on a formula simplification that was a NOOP. DAG size: 97 [2020-11-29 23:32:21,053 WARN L193 SmtUtils]: Spent 229.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 96 [2020-11-29 23:32:21,190 WARN L193 SmtUtils]: Spent 102.00 ms on a formula simplification that was a NOOP. DAG size: 96 [2020-11-29 23:32:22,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 23:32:22,799 INFO L93 Difference]: Finished difference Result 602 states and 869 transitions. [2020-11-29 23:32:22,799 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2020-11-29 23:32:22,799 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 51 [2020-11-29 23:32:22,800 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 23:32:22,802 INFO L225 Difference]: With dead ends: 602 [2020-11-29 23:32:22,803 INFO L226 Difference]: Without dead ends: 602 [2020-11-29 23:32:22,803 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=117, Invalid=345, Unknown=0, NotChecked=0, Total=462 [2020-11-29 23:32:22,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 602 states. [2020-11-29 23:32:22,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 602 to 535. [2020-11-29 23:32:22,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 535 states. [2020-11-29 23:32:22,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 535 states to 535 states and 770 transitions. [2020-11-29 23:32:22,825 INFO L78 Accepts]: Start accepts. Automaton has 535 states and 770 transitions. Word has length 51 [2020-11-29 23:32:22,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 23:32:22,826 INFO L481 AbstractCegarLoop]: Abstraction has 535 states and 770 transitions. [2020-11-29 23:32:22,826 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-11-29 23:32:22,826 INFO L276 IsEmpty]: Start isEmpty. Operand 535 states and 770 transitions. [2020-11-29 23:32:22,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2020-11-29 23:32:22,827 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 23:32:22,827 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] [2020-11-29 23:32:22,827 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2020-11-29 23:32:22,828 INFO L429 AbstractCegarLoop]: === Iteration 21 === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr0ENSURES_VIOLATIONMEMORY_LEAK]=== [2020-11-29 23:32:22,828 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 23:32:22,828 INFO L82 PathProgramCache]: Analyzing trace with hash 799983789, now seen corresponding path program 1 times [2020-11-29 23:32:22,828 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 23:32:22,829 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [179412270] [2020-11-29 23:32:22,829 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 23:32:22,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 23:32:22,966 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-29 23:32:22,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 23:32:23,014 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-11-29 23:32:23,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 23:32:23,041 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-11-29 23:32:23,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 23:32:23,061 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2020-11-29 23:32:23,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 23:32:23,069 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-29 23:32:23,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 23:32:23,082 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 23:32:23,082 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [179412270] [2020-11-29 23:32:23,082 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-29 23:32:23,082 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-11-29 23:32:23,083 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1255337284] [2020-11-29 23:32:23,083 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-11-29 23:32:23,083 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 23:32:23,084 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-11-29 23:32:23,084 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-11-29 23:32:23,084 INFO L87 Difference]: Start difference. First operand 535 states and 770 transitions. Second operand 7 states. [2020-11-29 23:32:24,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 23:32:24,034 INFO L93 Difference]: Finished difference Result 742 states and 1130 transitions. [2020-11-29 23:32:24,034 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-11-29 23:32:24,034 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 52 [2020-11-29 23:32:24,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 23:32:24,040 INFO L225 Difference]: With dead ends: 742 [2020-11-29 23:32:24,040 INFO L226 Difference]: Without dead ends: 742 [2020-11-29 23:32:24,040 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2020-11-29 23:32:24,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 742 states. [2020-11-29 23:32:24,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 742 to 562. [2020-11-29 23:32:24,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 562 states. [2020-11-29 23:32:24,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 562 states to 562 states and 798 transitions. [2020-11-29 23:32:24,068 INFO L78 Accepts]: Start accepts. Automaton has 562 states and 798 transitions. Word has length 52 [2020-11-29 23:32:24,068 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 23:32:24,068 INFO L481 AbstractCegarLoop]: Abstraction has 562 states and 798 transitions. [2020-11-29 23:32:24,069 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-11-29 23:32:24,069 INFO L276 IsEmpty]: Start isEmpty. Operand 562 states and 798 transitions. [2020-11-29 23:32:24,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2020-11-29 23:32:24,085 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 23:32:24,086 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] [2020-11-29 23:32:24,086 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2020-11-29 23:32:24,087 INFO L429 AbstractCegarLoop]: === Iteration 22 === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr0ENSURES_VIOLATIONMEMORY_LEAK]=== [2020-11-29 23:32:24,088 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 23:32:24,088 INFO L82 PathProgramCache]: Analyzing trace with hash -2058549331, now seen corresponding path program 1 times [2020-11-29 23:32:24,088 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 23:32:24,088 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1876924466] [2020-11-29 23:32:24,088 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 23:32:24,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 23:32:24,217 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-29 23:32:24,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 23:32:24,257 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-11-29 23:32:24,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 23:32:24,281 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-11-29 23:32:24,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 23:32:24,297 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2020-11-29 23:32:24,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 23:32:24,304 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-29 23:32:24,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 23:32:24,343 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 23:32:24,343 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1876924466] [2020-11-29 23:32:24,343 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-29 23:32:24,344 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-11-29 23:32:24,344 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1505451699] [2020-11-29 23:32:24,344 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-11-29 23:32:24,347 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 23:32:24,347 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-11-29 23:32:24,347 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2020-11-29 23:32:24,348 INFO L87 Difference]: Start difference. First operand 562 states and 798 transitions. Second operand 8 states. [2020-11-29 23:32:25,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 23:32:25,504 INFO L93 Difference]: Finished difference Result 583 states and 825 transitions. [2020-11-29 23:32:25,507 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-11-29 23:32:25,507 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 52 [2020-11-29 23:32:25,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 23:32:25,510 INFO L225 Difference]: With dead ends: 583 [2020-11-29 23:32:25,510 INFO L226 Difference]: Without dead ends: 583 [2020-11-29 23:32:25,510 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 11 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2020-11-29 23:32:25,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 583 states. [2020-11-29 23:32:25,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 583 to 565. [2020-11-29 23:32:25,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 565 states. [2020-11-29 23:32:25,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 565 states to 565 states and 802 transitions. [2020-11-29 23:32:25,531 INFO L78 Accepts]: Start accepts. Automaton has 565 states and 802 transitions. Word has length 52 [2020-11-29 23:32:25,531 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 23:32:25,531 INFO L481 AbstractCegarLoop]: Abstraction has 565 states and 802 transitions. [2020-11-29 23:32:25,531 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-11-29 23:32:25,531 INFO L276 IsEmpty]: Start isEmpty. Operand 565 states and 802 transitions. [2020-11-29 23:32:25,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2020-11-29 23:32:25,532 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 23:32:25,532 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] [2020-11-29 23:32:25,533 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2020-11-29 23:32:25,533 INFO L429 AbstractCegarLoop]: === Iteration 23 === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr0ENSURES_VIOLATIONMEMORY_LEAK]=== [2020-11-29 23:32:25,533 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 23:32:25,534 INFO L82 PathProgramCache]: Analyzing trace with hash 547474223, now seen corresponding path program 1 times [2020-11-29 23:32:25,534 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 23:32:25,534 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1204392053] [2020-11-29 23:32:25,534 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 23:32:25,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 23:32:25,677 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-29 23:32:25,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 23:32:25,729 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-11-29 23:32:25,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 23:32:25,756 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-11-29 23:32:25,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 23:32:25,776 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2020-11-29 23:32:25,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 23:32:25,805 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-29 23:32:25,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 23:32:25,845 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 23:32:25,845 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1204392053] [2020-11-29 23:32:25,845 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-29 23:32:25,845 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-11-29 23:32:25,847 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1275876446] [2020-11-29 23:32:25,847 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-11-29 23:32:25,848 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 23:32:25,848 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-11-29 23:32:25,848 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2020-11-29 23:32:25,848 INFO L87 Difference]: Start difference. First operand 565 states and 802 transitions. Second operand 11 states. [2020-11-29 23:32:26,075 WARN L193 SmtUtils]: Spent 180.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 93 [2020-11-29 23:32:27,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 23:32:27,738 INFO L93 Difference]: Finished difference Result 620 states and 930 transitions. [2020-11-29 23:32:27,738 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-11-29 23:32:27,739 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 52 [2020-11-29 23:32:27,739 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 23:32:27,743 INFO L225 Difference]: With dead ends: 620 [2020-11-29 23:32:27,743 INFO L226 Difference]: Without dead ends: 620 [2020-11-29 23:32:27,744 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=92, Invalid=288, Unknown=0, NotChecked=0, Total=380 [2020-11-29 23:32:27,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 620 states. [2020-11-29 23:32:27,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 620 to 525. [2020-11-29 23:32:27,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 525 states. [2020-11-29 23:32:27,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 525 states to 525 states and 752 transitions. [2020-11-29 23:32:27,766 INFO L78 Accepts]: Start accepts. Automaton has 525 states and 752 transitions. Word has length 52 [2020-11-29 23:32:27,766 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 23:32:27,767 INFO L481 AbstractCegarLoop]: Abstraction has 525 states and 752 transitions. [2020-11-29 23:32:27,767 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-11-29 23:32:27,767 INFO L276 IsEmpty]: Start isEmpty. Operand 525 states and 752 transitions. [2020-11-29 23:32:27,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2020-11-29 23:32:27,768 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 23:32:27,768 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 23:32:27,768 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2020-11-29 23:32:27,769 INFO L429 AbstractCegarLoop]: === Iteration 24 === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr0ENSURES_VIOLATIONMEMORY_LEAK]=== [2020-11-29 23:32:27,769 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 23:32:27,769 INFO L82 PathProgramCache]: Analyzing trace with hash 187625046, now seen corresponding path program 1 times [2020-11-29 23:32:27,769 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 23:32:27,769 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [164407162] [2020-11-29 23:32:27,770 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 23:32:27,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 23:32:27,911 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-29 23:32:27,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 23:32:27,961 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-11-29 23:32:27,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 23:32:27,989 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-11-29 23:32:27,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 23:32:28,008 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2020-11-29 23:32:28,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 23:32:28,046 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-29 23:32:28,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 23:32:28,082 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 23:32:28,083 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [164407162] [2020-11-29 23:32:28,083 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-29 23:32:28,083 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-11-29 23:32:28,083 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1925631556] [2020-11-29 23:32:28,083 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-11-29 23:32:28,084 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 23:32:28,084 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-11-29 23:32:28,084 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2020-11-29 23:32:28,085 INFO L87 Difference]: Start difference. First operand 525 states and 752 transitions. Second operand 12 states. [2020-11-29 23:32:29,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 23:32:29,111 INFO L93 Difference]: Finished difference Result 545 states and 779 transitions. [2020-11-29 23:32:29,112 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-11-29 23:32:29,112 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 53 [2020-11-29 23:32:29,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 23:32:29,115 INFO L225 Difference]: With dead ends: 545 [2020-11-29 23:32:29,115 INFO L226 Difference]: Without dead ends: 544 [2020-11-29 23:32:29,115 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2020-11-29 23:32:29,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 544 states. [2020-11-29 23:32:29,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 544 to 532. [2020-11-29 23:32:29,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 532 states. [2020-11-29 23:32:29,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 532 states to 532 states and 761 transitions. [2020-11-29 23:32:29,132 INFO L78 Accepts]: Start accepts. Automaton has 532 states and 761 transitions. Word has length 53 [2020-11-29 23:32:29,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 23:32:29,133 INFO L481 AbstractCegarLoop]: Abstraction has 532 states and 761 transitions. [2020-11-29 23:32:29,133 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-11-29 23:32:29,133 INFO L276 IsEmpty]: Start isEmpty. Operand 532 states and 761 transitions. [2020-11-29 23:32:29,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2020-11-29 23:32:29,134 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 23:32:29,134 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 23:32:29,134 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2020-11-29 23:32:29,134 INFO L429 AbstractCegarLoop]: === Iteration 25 === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr0ENSURES_VIOLATIONMEMORY_LEAK]=== [2020-11-29 23:32:29,135 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 23:32:29,135 INFO L82 PathProgramCache]: Analyzing trace with hash 179043316, now seen corresponding path program 1 times [2020-11-29 23:32:29,135 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 23:32:29,135 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [381626757] [2020-11-29 23:32:29,135 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 23:32:29,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 23:32:29,258 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-29 23:32:29,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 23:32:29,346 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-11-29 23:32:29,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 23:32:29,383 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-11-29 23:32:29,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 23:32:29,417 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2020-11-29 23:32:29,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 23:32:29,498 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-29 23:32:29,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 23:32:29,551 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 23:32:29,551 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [381626757] [2020-11-29 23:32:29,551 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-29 23:32:29,552 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-11-29 23:32:29,552 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1845071912] [2020-11-29 23:32:29,552 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-11-29 23:32:29,552 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 23:32:29,553 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-11-29 23:32:29,553 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2020-11-29 23:32:29,553 INFO L87 Difference]: Start difference. First operand 532 states and 761 transitions. Second operand 12 states. [2020-11-29 23:32:30,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 23:32:30,549 INFO L93 Difference]: Finished difference Result 560 states and 795 transitions. [2020-11-29 23:32:30,549 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-11-29 23:32:30,549 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 53 [2020-11-29 23:32:30,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 23:32:30,552 INFO L225 Difference]: With dead ends: 560 [2020-11-29 23:32:30,552 INFO L226 Difference]: Without dead ends: 539 [2020-11-29 23:32:30,552 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 9 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=38, Invalid=144, Unknown=0, NotChecked=0, Total=182 [2020-11-29 23:32:30,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 539 states. [2020-11-29 23:32:30,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 539 to 531. [2020-11-29 23:32:30,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 531 states. [2020-11-29 23:32:30,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 531 states to 531 states and 759 transitions. [2020-11-29 23:32:30,569 INFO L78 Accepts]: Start accepts. Automaton has 531 states and 759 transitions. Word has length 53 [2020-11-29 23:32:30,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 23:32:30,570 INFO L481 AbstractCegarLoop]: Abstraction has 531 states and 759 transitions. [2020-11-29 23:32:30,570 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-11-29 23:32:30,570 INFO L276 IsEmpty]: Start isEmpty. Operand 531 states and 759 transitions. [2020-11-29 23:32:30,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2020-11-29 23:32:30,571 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 23:32:30,571 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] [2020-11-29 23:32:30,571 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2020-11-29 23:32:30,571 INFO L429 AbstractCegarLoop]: === Iteration 26 === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr0ENSURES_VIOLATIONMEMORY_LEAK]=== [2020-11-29 23:32:30,572 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 23:32:30,572 INFO L82 PathProgramCache]: Analyzing trace with hash -512091310, now seen corresponding path program 1 times [2020-11-29 23:32:30,572 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 23:32:30,572 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1594302900] [2020-11-29 23:32:30,573 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 23:32:30,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 23:32:30,720 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-29 23:32:30,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 23:32:30,764 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-11-29 23:32:30,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 23:32:30,799 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-11-29 23:32:30,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 23:32:30,811 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2020-11-29 23:32:30,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 23:32:30,815 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-11-29 23:32:30,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 23:32:30,827 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2020-11-29 23:32:30,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 23:32:30,836 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 23:32:30,836 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1594302900] [2020-11-29 23:32:30,836 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-29 23:32:30,837 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-11-29 23:32:30,837 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [505526114] [2020-11-29 23:32:30,837 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-11-29 23:32:30,838 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 23:32:30,838 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-11-29 23:32:30,838 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2020-11-29 23:32:30,838 INFO L87 Difference]: Start difference. First operand 531 states and 759 transitions. Second operand 8 states. [2020-11-29 23:32:32,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 23:32:32,039 INFO L93 Difference]: Finished difference Result 550 states and 801 transitions. [2020-11-29 23:32:32,039 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-11-29 23:32:32,039 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 59 [2020-11-29 23:32:32,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 23:32:32,042 INFO L225 Difference]: With dead ends: 550 [2020-11-29 23:32:32,042 INFO L226 Difference]: Without dead ends: 550 [2020-11-29 23:32:32,042 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=84, Unknown=0, NotChecked=0, Total=132 [2020-11-29 23:32:32,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 550 states. [2020-11-29 23:32:32,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 550 to 530. [2020-11-29 23:32:32,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 530 states. [2020-11-29 23:32:32,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 530 states to 530 states and 755 transitions. [2020-11-29 23:32:32,063 INFO L78 Accepts]: Start accepts. Automaton has 530 states and 755 transitions. Word has length 59 [2020-11-29 23:32:32,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 23:32:32,064 INFO L481 AbstractCegarLoop]: Abstraction has 530 states and 755 transitions. [2020-11-29 23:32:32,064 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-11-29 23:32:32,064 INFO L276 IsEmpty]: Start isEmpty. Operand 530 states and 755 transitions. [2020-11-29 23:32:32,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2020-11-29 23:32:32,065 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 23:32:32,065 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] [2020-11-29 23:32:32,065 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2020-11-29 23:32:32,066 INFO L429 AbstractCegarLoop]: === Iteration 27 === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr0ENSURES_VIOLATIONMEMORY_LEAK]=== [2020-11-29 23:32:32,066 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 23:32:32,066 INFO L82 PathProgramCache]: Analyzing trace with hash -1059408739, now seen corresponding path program 1 times [2020-11-29 23:32:32,066 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 23:32:32,067 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [427062980] [2020-11-29 23:32:32,067 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 23:32:32,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 23:32:32,238 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-29 23:32:32,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 23:32:32,284 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-11-29 23:32:32,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 23:32:32,315 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-11-29 23:32:32,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 23:32:32,336 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2020-11-29 23:32:32,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 23:32:32,359 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-29 23:32:32,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 23:32:32,374 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 23:32:32,374 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [427062980] [2020-11-29 23:32:32,374 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-29 23:32:32,375 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-11-29 23:32:32,375 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2069986640] [2020-11-29 23:32:32,375 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-11-29 23:32:32,375 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 23:32:32,376 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-11-29 23:32:32,376 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2020-11-29 23:32:32,376 INFO L87 Difference]: Start difference. First operand 530 states and 755 transitions. Second operand 9 states. [2020-11-29 23:32:32,679 WARN L193 SmtUtils]: Spent 103.00 ms on a formula simplification that was a NOOP. DAG size: 95 [2020-11-29 23:32:33,258 WARN L193 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 96 [2020-11-29 23:32:34,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 23:32:34,535 INFO L93 Difference]: Finished difference Result 673 states and 997 transitions. [2020-11-29 23:32:34,536 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-11-29 23:32:34,536 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 54 [2020-11-29 23:32:34,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 23:32:34,539 INFO L225 Difference]: With dead ends: 673 [2020-11-29 23:32:34,539 INFO L226 Difference]: Without dead ends: 641 [2020-11-29 23:32:34,540 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 10 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=74, Invalid=166, Unknown=0, NotChecked=0, Total=240 [2020-11-29 23:32:34,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 641 states. [2020-11-29 23:32:34,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 641 to 561. [2020-11-29 23:32:34,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 561 states. [2020-11-29 23:32:34,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 561 states to 561 states and 825 transitions. [2020-11-29 23:32:34,562 INFO L78 Accepts]: Start accepts. Automaton has 561 states and 825 transitions. Word has length 54 [2020-11-29 23:32:34,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 23:32:34,563 INFO L481 AbstractCegarLoop]: Abstraction has 561 states and 825 transitions. [2020-11-29 23:32:34,563 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-11-29 23:32:34,563 INFO L276 IsEmpty]: Start isEmpty. Operand 561 states and 825 transitions. [2020-11-29 23:32:34,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2020-11-29 23:32:34,564 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 23:32:34,564 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] [2020-11-29 23:32:34,564 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2020-11-29 23:32:34,565 INFO L429 AbstractCegarLoop]: === Iteration 28 === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr0ENSURES_VIOLATIONMEMORY_LEAK]=== [2020-11-29 23:32:34,565 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 23:32:34,565 INFO L82 PathProgramCache]: Analyzing trace with hash -708439553, now seen corresponding path program 1 times [2020-11-29 23:32:34,565 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 23:32:34,566 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [189968276] [2020-11-29 23:32:34,566 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 23:32:34,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 23:32:34,729 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-29 23:32:34,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 23:32:34,784 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-11-29 23:32:34,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 23:32:34,817 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-11-29 23:32:34,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 23:32:34,840 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2020-11-29 23:32:34,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 23:32:34,989 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-29 23:32:34,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 23:32:35,033 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-11-29 23:32:35,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 23:32:35,045 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 23:32:35,045 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [189968276] [2020-11-29 23:32:35,045 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-29 23:32:35,045 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2020-11-29 23:32:35,046 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1499976577] [2020-11-29 23:32:35,047 INFO L461 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-11-29 23:32:35,047 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 23:32:35,048 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-11-29 23:32:35,048 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2020-11-29 23:32:35,048 INFO L87 Difference]: Start difference. First operand 561 states and 825 transitions. Second operand 13 states. [2020-11-29 23:32:36,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 23:32:36,335 INFO L93 Difference]: Finished difference Result 391 states and 523 transitions. [2020-11-29 23:32:36,335 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-11-29 23:32:36,335 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 63 [2020-11-29 23:32:36,336 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 23:32:36,337 INFO L225 Difference]: With dead ends: 391 [2020-11-29 23:32:36,338 INFO L226 Difference]: Without dead ends: 391 [2020-11-29 23:32:36,338 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=37, Invalid=145, Unknown=0, NotChecked=0, Total=182 [2020-11-29 23:32:36,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 391 states. [2020-11-29 23:32:36,347 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 391 to 339. [2020-11-29 23:32:36,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 339 states. [2020-11-29 23:32:36,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 339 states to 339 states and 443 transitions. [2020-11-29 23:32:36,350 INFO L78 Accepts]: Start accepts. Automaton has 339 states and 443 transitions. Word has length 63 [2020-11-29 23:32:36,350 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 23:32:36,350 INFO L481 AbstractCegarLoop]: Abstraction has 339 states and 443 transitions. [2020-11-29 23:32:36,350 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-11-29 23:32:36,351 INFO L276 IsEmpty]: Start isEmpty. Operand 339 states and 443 transitions. [2020-11-29 23:32:36,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2020-11-29 23:32:36,352 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 23:32:36,352 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] [2020-11-29 23:32:36,352 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2020-11-29 23:32:36,352 INFO L429 AbstractCegarLoop]: === Iteration 29 === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr0ENSURES_VIOLATIONMEMORY_LEAK]=== [2020-11-29 23:32:36,353 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 23:32:36,353 INFO L82 PathProgramCache]: Analyzing trace with hash 431683977, now seen corresponding path program 1 times [2020-11-29 23:32:36,353 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 23:32:36,353 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [544818749] [2020-11-29 23:32:36,354 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 23:32:36,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 23:32:36,510 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-29 23:32:36,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 23:32:36,558 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-11-29 23:32:36,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 23:32:36,585 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-11-29 23:32:36,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 23:32:36,614 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2020-11-29 23:32:36,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 23:32:36,677 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-29 23:32:36,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 23:32:36,714 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-29 23:32:36,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 23:32:36,764 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 23:32:36,765 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [544818749] [2020-11-29 23:32:36,765 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-29 23:32:36,765 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2020-11-29 23:32:36,765 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [440707016] [2020-11-29 23:32:36,766 INFO L461 AbstractCegarLoop]: Interpolant automaton has 15 states [2020-11-29 23:32:36,766 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 23:32:36,766 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2020-11-29 23:32:36,769 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=175, Unknown=0, NotChecked=0, Total=210 [2020-11-29 23:32:36,769 INFO L87 Difference]: Start difference. First operand 339 states and 443 transitions. Second operand 15 states. [2020-11-29 23:32:38,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 23:32:38,493 INFO L93 Difference]: Finished difference Result 344 states and 452 transitions. [2020-11-29 23:32:38,494 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-11-29 23:32:38,494 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 59 [2020-11-29 23:32:38,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 23:32:38,495 INFO L225 Difference]: With dead ends: 344 [2020-11-29 23:32:38,496 INFO L226 Difference]: Without dead ends: 305 [2020-11-29 23:32:38,496 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=201, Unknown=0, NotChecked=0, Total=240 [2020-11-29 23:32:38,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 305 states. [2020-11-29 23:32:38,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 305 to 299. [2020-11-29 23:32:38,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 299 states. [2020-11-29 23:32:38,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 299 states to 299 states and 399 transitions. [2020-11-29 23:32:38,508 INFO L78 Accepts]: Start accepts. Automaton has 299 states and 399 transitions. Word has length 59 [2020-11-29 23:32:38,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 23:32:38,508 INFO L481 AbstractCegarLoop]: Abstraction has 299 states and 399 transitions. [2020-11-29 23:32:38,509 INFO L482 AbstractCegarLoop]: Interpolant automaton has 15 states. [2020-11-29 23:32:38,509 INFO L276 IsEmpty]: Start isEmpty. Operand 299 states and 399 transitions. [2020-11-29 23:32:38,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2020-11-29 23:32:38,510 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 23:32:38,510 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 23:32:38,510 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2020-11-29 23:32:38,511 INFO L429 AbstractCegarLoop]: === Iteration 30 === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr0ENSURES_VIOLATIONMEMORY_LEAK]=== [2020-11-29 23:32:38,511 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 23:32:38,511 INFO L82 PathProgramCache]: Analyzing trace with hash 942043431, now seen corresponding path program 1 times [2020-11-29 23:32:38,512 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 23:32:38,512 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [214966404] [2020-11-29 23:32:38,512 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 23:32:38,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 23:32:38,672 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-29 23:32:38,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 23:32:38,721 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-11-29 23:32:38,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 23:32:38,750 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-11-29 23:32:38,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 23:32:38,772 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2020-11-29 23:32:38,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 23:32:38,845 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-29 23:32:38,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 23:32:38,847 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-11-29 23:32:38,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 23:32:38,864 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2020-11-29 23:32:38,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 23:32:38,896 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 23:32:38,896 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [214966404] [2020-11-29 23:32:38,896 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-29 23:32:38,896 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-11-29 23:32:38,896 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [60485440] [2020-11-29 23:32:38,897 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-11-29 23:32:38,897 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 23:32:38,897 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-11-29 23:32:38,897 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2020-11-29 23:32:38,898 INFO L87 Difference]: Start difference. First operand 299 states and 399 transitions. Second operand 12 states. [2020-11-29 23:32:39,056 WARN L193 SmtUtils]: Spent 105.00 ms on a formula simplification that was a NOOP. DAG size: 96 [2020-11-29 23:32:39,215 WARN L193 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 95 [2020-11-29 23:32:40,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 23:32:40,267 INFO L93 Difference]: Finished difference Result 317 states and 430 transitions. [2020-11-29 23:32:40,268 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-11-29 23:32:40,268 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 68 [2020-11-29 23:32:40,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 23:32:40,270 INFO L225 Difference]: With dead ends: 317 [2020-11-29 23:32:40,270 INFO L226 Difference]: Without dead ends: 317 [2020-11-29 23:32:40,271 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=94, Invalid=286, Unknown=0, NotChecked=0, Total=380 [2020-11-29 23:32:40,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 317 states. [2020-11-29 23:32:40,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 317 to 299. [2020-11-29 23:32:40,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 299 states. [2020-11-29 23:32:40,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 299 states to 299 states and 397 transitions. [2020-11-29 23:32:40,280 INFO L78 Accepts]: Start accepts. Automaton has 299 states and 397 transitions. Word has length 68 [2020-11-29 23:32:40,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 23:32:40,280 INFO L481 AbstractCegarLoop]: Abstraction has 299 states and 397 transitions. [2020-11-29 23:32:40,280 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-11-29 23:32:40,281 INFO L276 IsEmpty]: Start isEmpty. Operand 299 states and 397 transitions. [2020-11-29 23:32:40,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2020-11-29 23:32:40,282 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 23:32:40,282 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] [2020-11-29 23:32:40,282 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2020-11-29 23:32:40,282 INFO L429 AbstractCegarLoop]: === Iteration 31 === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr0ENSURES_VIOLATIONMEMORY_LEAK]=== [2020-11-29 23:32:40,283 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 23:32:40,283 INFO L82 PathProgramCache]: Analyzing trace with hash -2002859616, now seen corresponding path program 1 times [2020-11-29 23:32:40,283 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 23:32:40,283 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1950383738] [2020-11-29 23:32:40,284 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 23:32:40,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 23:32:40,435 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-29 23:32:40,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 23:32:40,490 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-11-29 23:32:40,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 23:32:40,518 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-11-29 23:32:40,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 23:32:40,540 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2020-11-29 23:32:40,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 23:32:40,588 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-29 23:32:40,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 23:32:40,590 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-11-29 23:32:40,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 23:32:40,609 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2020-11-29 23:32:40,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 23:32:40,622 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 23:32:40,622 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1950383738] [2020-11-29 23:32:40,623 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-29 23:32:40,623 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-11-29 23:32:40,623 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1518418261] [2020-11-29 23:32:40,623 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-11-29 23:32:40,624 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 23:32:40,624 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-11-29 23:32:40,624 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2020-11-29 23:32:40,625 INFO L87 Difference]: Start difference. First operand 299 states and 397 transitions. Second operand 12 states. [2020-11-29 23:32:41,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 23:32:41,556 INFO L93 Difference]: Finished difference Result 331 states and 454 transitions. [2020-11-29 23:32:41,556 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-11-29 23:32:41,556 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 70 [2020-11-29 23:32:41,556 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 23:32:41,559 INFO L225 Difference]: With dead ends: 331 [2020-11-29 23:32:41,559 INFO L226 Difference]: Without dead ends: 331 [2020-11-29 23:32:41,559 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2020-11-29 23:32:41,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 331 states. [2020-11-29 23:32:41,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 331 to 304. [2020-11-29 23:32:41,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 304 states. [2020-11-29 23:32:41,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 304 states to 304 states and 410 transitions. [2020-11-29 23:32:41,572 INFO L78 Accepts]: Start accepts. Automaton has 304 states and 410 transitions. Word has length 70 [2020-11-29 23:32:41,572 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 23:32:41,572 INFO L481 AbstractCegarLoop]: Abstraction has 304 states and 410 transitions. [2020-11-29 23:32:41,572 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-11-29 23:32:41,572 INFO L276 IsEmpty]: Start isEmpty. Operand 304 states and 410 transitions. [2020-11-29 23:32:41,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2020-11-29 23:32:41,573 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 23:32:41,574 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] [2020-11-29 23:32:41,574 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2020-11-29 23:32:41,574 INFO L429 AbstractCegarLoop]: === Iteration 32 === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr0ENSURES_VIOLATIONMEMORY_LEAK]=== [2020-11-29 23:32:41,575 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 23:32:41,575 INFO L82 PathProgramCache]: Analyzing trace with hash 1535088009, now seen corresponding path program 1 times [2020-11-29 23:32:41,575 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 23:32:41,575 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [934993690] [2020-11-29 23:32:41,576 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 23:32:41,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 23:32:41,717 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-29 23:32:41,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 23:32:41,763 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-11-29 23:32:41,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 23:32:41,783 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-11-29 23:32:41,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 23:32:41,814 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2020-11-29 23:32:41,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 23:32:41,844 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-29 23:32:41,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 23:32:41,847 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-11-29 23:32:41,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 23:32:41,863 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2020-11-29 23:32:41,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 23:32:41,875 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 23:32:41,876 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [934993690] [2020-11-29 23:32:41,876 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-29 23:32:41,876 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-11-29 23:32:41,876 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1521313687] [2020-11-29 23:32:41,877 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-11-29 23:32:41,877 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 23:32:41,877 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-11-29 23:32:41,878 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2020-11-29 23:32:41,878 INFO L87 Difference]: Start difference. First operand 304 states and 410 transitions. Second operand 9 states. [2020-11-29 23:32:42,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 23:32:42,624 INFO L93 Difference]: Finished difference Result 316 states and 424 transitions. [2020-11-29 23:32:42,625 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-11-29 23:32:42,625 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 71 [2020-11-29 23:32:42,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 23:32:42,627 INFO L225 Difference]: With dead ends: 316 [2020-11-29 23:32:42,627 INFO L226 Difference]: Without dead ends: 316 [2020-11-29 23:32:42,628 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2020-11-29 23:32:42,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 316 states. [2020-11-29 23:32:42,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 316 to 298. [2020-11-29 23:32:42,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 298 states. [2020-11-29 23:32:42,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 298 states to 298 states and 393 transitions. [2020-11-29 23:32:42,638 INFO L78 Accepts]: Start accepts. Automaton has 298 states and 393 transitions. Word has length 71 [2020-11-29 23:32:42,639 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 23:32:42,639 INFO L481 AbstractCegarLoop]: Abstraction has 298 states and 393 transitions. [2020-11-29 23:32:42,639 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-11-29 23:32:42,639 INFO L276 IsEmpty]: Start isEmpty. Operand 298 states and 393 transitions. [2020-11-29 23:32:42,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2020-11-29 23:32:42,640 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 23:32:42,641 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] [2020-11-29 23:32:42,641 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2020-11-29 23:32:42,641 INFO L429 AbstractCegarLoop]: === Iteration 33 === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr0ENSURES_VIOLATIONMEMORY_LEAK]=== [2020-11-29 23:32:42,641 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 23:32:42,642 INFO L82 PathProgramCache]: Analyzing trace with hash -1748762037, now seen corresponding path program 1 times [2020-11-29 23:32:42,642 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 23:32:42,642 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [823581319] [2020-11-29 23:32:42,642 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 23:32:42,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 23:32:42,807 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-29 23:32:42,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 23:32:42,870 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-11-29 23:32:42,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 23:32:42,895 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-11-29 23:32:42,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 23:32:42,914 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2020-11-29 23:32:42,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 23:32:42,930 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-29 23:32:42,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 23:32:42,933 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-11-29 23:32:42,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 23:32:42,948 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2020-11-29 23:32:42,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 23:32:42,962 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 23:32:42,962 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [823581319] [2020-11-29 23:32:42,962 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-29 23:32:42,962 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-11-29 23:32:42,963 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [217013305] [2020-11-29 23:32:42,963 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-11-29 23:32:42,963 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 23:32:42,964 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-11-29 23:32:42,964 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2020-11-29 23:32:42,964 INFO L87 Difference]: Start difference. First operand 298 states and 393 transitions. Second operand 9 states. [2020-11-29 23:32:43,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 23:32:43,608 INFO L93 Difference]: Finished difference Result 451 states and 620 transitions. [2020-11-29 23:32:43,609 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-11-29 23:32:43,609 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 71 [2020-11-29 23:32:43,609 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 23:32:43,612 INFO L225 Difference]: With dead ends: 451 [2020-11-29 23:32:43,612 INFO L226 Difference]: Without dead ends: 451 [2020-11-29 23:32:43,615 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=51, Invalid=81, Unknown=0, NotChecked=0, Total=132 [2020-11-29 23:32:43,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 451 states. [2020-11-29 23:32:43,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 451 to 326. [2020-11-29 23:32:43,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 326 states. [2020-11-29 23:32:43,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 326 states to 326 states and 435 transitions. [2020-11-29 23:32:43,630 INFO L78 Accepts]: Start accepts. Automaton has 326 states and 435 transitions. Word has length 71 [2020-11-29 23:32:43,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 23:32:43,630 INFO L481 AbstractCegarLoop]: Abstraction has 326 states and 435 transitions. [2020-11-29 23:32:43,630 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-11-29 23:32:43,631 INFO L276 IsEmpty]: Start isEmpty. Operand 326 states and 435 transitions. [2020-11-29 23:32:43,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2020-11-29 23:32:43,639 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 23:32:43,639 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] [2020-11-29 23:32:43,639 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2020-11-29 23:32:43,639 INFO L429 AbstractCegarLoop]: === Iteration 34 === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr0ENSURES_VIOLATIONMEMORY_LEAK]=== [2020-11-29 23:32:43,640 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 23:32:43,640 INFO L82 PathProgramCache]: Analyzing trace with hash -1456101440, now seen corresponding path program 1 times [2020-11-29 23:32:43,640 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 23:32:43,641 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [355149319] [2020-11-29 23:32:43,641 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 23:32:43,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 23:32:43,815 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-29 23:32:43,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 23:32:43,855 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-11-29 23:32:43,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 23:32:43,879 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-11-29 23:32:43,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 23:32:43,899 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2020-11-29 23:32:43,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 23:32:43,923 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-29 23:32:43,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 23:32:43,927 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-11-29 23:32:43,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 23:32:43,949 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2020-11-29 23:32:43,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 23:32:43,966 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 23:32:43,966 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [355149319] [2020-11-29 23:32:43,967 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-29 23:32:43,967 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-11-29 23:32:43,967 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1940174342] [2020-11-29 23:32:43,967 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-11-29 23:32:43,967 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 23:32:43,968 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-11-29 23:32:43,968 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2020-11-29 23:32:43,968 INFO L87 Difference]: Start difference. First operand 326 states and 435 transitions. Second operand 9 states. [2020-11-29 23:32:45,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 23:32:45,123 INFO L93 Difference]: Finished difference Result 552 states and 780 transitions. [2020-11-29 23:32:45,123 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-11-29 23:32:45,123 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 72 [2020-11-29 23:32:45,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 23:32:45,127 INFO L225 Difference]: With dead ends: 552 [2020-11-29 23:32:45,128 INFO L226 Difference]: Without dead ends: 552 [2020-11-29 23:32:45,128 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=57, Invalid=99, Unknown=0, NotChecked=0, Total=156 [2020-11-29 23:32:45,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 552 states. [2020-11-29 23:32:45,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 552 to 521. [2020-11-29 23:32:45,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 521 states. [2020-11-29 23:32:45,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 521 states to 521 states and 749 transitions. [2020-11-29 23:32:45,147 INFO L78 Accepts]: Start accepts. Automaton has 521 states and 749 transitions. Word has length 72 [2020-11-29 23:32:45,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 23:32:45,148 INFO L481 AbstractCegarLoop]: Abstraction has 521 states and 749 transitions. [2020-11-29 23:32:45,148 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-11-29 23:32:45,148 INFO L276 IsEmpty]: Start isEmpty. Operand 521 states and 749 transitions. [2020-11-29 23:32:45,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2020-11-29 23:32:45,150 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 23:32:45,150 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] [2020-11-29 23:32:45,150 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2020-11-29 23:32:45,150 INFO L429 AbstractCegarLoop]: === Iteration 35 === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr0ENSURES_VIOLATIONMEMORY_LEAK]=== [2020-11-29 23:32:45,151 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 23:32:45,151 INFO L82 PathProgramCache]: Analyzing trace with hash -1295937770, now seen corresponding path program 1 times [2020-11-29 23:32:45,151 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 23:32:45,151 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1730256564] [2020-11-29 23:32:45,151 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 23:32:45,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 23:32:45,312 WARN L193 SmtUtils]: Spent 110.00 ms on a formula simplification that was a NOOP. DAG size: 91 [2020-11-29 23:32:45,313 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-29 23:32:45,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 23:32:45,359 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-11-29 23:32:45,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 23:32:45,384 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-11-29 23:32:45,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 23:32:45,408 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2020-11-29 23:32:45,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 23:32:45,479 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-11-29 23:32:45,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 23:32:45,540 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-29 23:32:45,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 23:32:45,543 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-11-29 23:32:45,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 23:32:45,568 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2020-11-29 23:32:45,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 23:32:45,586 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 23:32:45,587 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1730256564] [2020-11-29 23:32:45,587 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-29 23:32:45,587 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2020-11-29 23:32:45,587 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [73948122] [2020-11-29 23:32:45,589 INFO L461 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-11-29 23:32:45,589 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 23:32:45,589 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-11-29 23:32:45,590 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2020-11-29 23:32:45,590 INFO L87 Difference]: Start difference. First operand 521 states and 749 transitions. Second operand 13 states. [2020-11-29 23:32:46,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 23:32:46,585 INFO L93 Difference]: Finished difference Result 524 states and 752 transitions. [2020-11-29 23:32:46,586 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-11-29 23:32:46,586 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 73 [2020-11-29 23:32:46,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 23:32:46,589 INFO L225 Difference]: With dead ends: 524 [2020-11-29 23:32:46,589 INFO L226 Difference]: Without dead ends: 524 [2020-11-29 23:32:46,589 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=45, Invalid=137, Unknown=0, NotChecked=0, Total=182 [2020-11-29 23:32:46,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 524 states. [2020-11-29 23:32:46,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 524 to 521. [2020-11-29 23:32:46,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 521 states. [2020-11-29 23:32:46,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 521 states to 521 states and 748 transitions. [2020-11-29 23:32:46,606 INFO L78 Accepts]: Start accepts. Automaton has 521 states and 748 transitions. Word has length 73 [2020-11-29 23:32:46,606 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 23:32:46,606 INFO L481 AbstractCegarLoop]: Abstraction has 521 states and 748 transitions. [2020-11-29 23:32:46,607 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-11-29 23:32:46,607 INFO L276 IsEmpty]: Start isEmpty. Operand 521 states and 748 transitions. [2020-11-29 23:32:46,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2020-11-29 23:32:46,608 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 23:32:46,608 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] [2020-11-29 23:32:46,609 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2020-11-29 23:32:46,609 INFO L429 AbstractCegarLoop]: === Iteration 36 === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr0ENSURES_VIOLATIONMEMORY_LEAK]=== [2020-11-29 23:32:46,609 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 23:32:46,609 INFO L82 PathProgramCache]: Analyzing trace with hash 581076831, now seen corresponding path program 1 times [2020-11-29 23:32:46,610 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 23:32:46,610 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1990773145] [2020-11-29 23:32:46,610 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 23:32:46,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 23:32:46,749 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-29 23:32:46,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 23:32:46,797 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-11-29 23:32:46,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 23:32:46,822 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-11-29 23:32:46,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 23:32:46,847 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2020-11-29 23:32:46,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 23:32:46,900 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-11-29 23:32:46,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 23:32:46,921 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-29 23:32:46,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 23:32:46,923 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-11-29 23:32:46,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 23:32:46,939 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2020-11-29 23:32:46,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 23:32:46,959 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2020-11-29 23:32:46,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 23:32:46,991 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 23:32:46,991 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1990773145] [2020-11-29 23:32:46,992 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-29 23:32:46,992 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-11-29 23:32:46,992 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [850797742] [2020-11-29 23:32:46,992 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-11-29 23:32:46,992 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 23:32:46,993 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-11-29 23:32:46,993 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=87, Unknown=0, NotChecked=0, Total=132 [2020-11-29 23:32:46,993 INFO L87 Difference]: Start difference. First operand 521 states and 748 transitions. Second operand 12 states. [2020-11-29 23:32:47,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 23:32:47,900 INFO L93 Difference]: Finished difference Result 482 states and 677 transitions. [2020-11-29 23:32:47,901 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-11-29 23:32:47,901 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 84 [2020-11-29 23:32:47,902 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 23:32:47,905 INFO L225 Difference]: With dead ends: 482 [2020-11-29 23:32:47,905 INFO L226 Difference]: Without dead ends: 482 [2020-11-29 23:32:47,905 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=97, Invalid=209, Unknown=0, NotChecked=0, Total=306 [2020-11-29 23:32:47,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 482 states. [2020-11-29 23:32:47,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 482 to 473. [2020-11-29 23:32:47,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 473 states. [2020-11-29 23:32:47,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 473 states to 473 states and 665 transitions. [2020-11-29 23:32:47,922 INFO L78 Accepts]: Start accepts. Automaton has 473 states and 665 transitions. Word has length 84 [2020-11-29 23:32:47,922 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 23:32:47,922 INFO L481 AbstractCegarLoop]: Abstraction has 473 states and 665 transitions. [2020-11-29 23:32:47,922 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-11-29 23:32:47,922 INFO L276 IsEmpty]: Start isEmpty. Operand 473 states and 665 transitions. [2020-11-29 23:32:47,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2020-11-29 23:32:47,924 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 23:32:47,924 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] [2020-11-29 23:32:47,924 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2020-11-29 23:32:47,925 INFO L429 AbstractCegarLoop]: === Iteration 37 === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr0ENSURES_VIOLATIONMEMORY_LEAK]=== [2020-11-29 23:32:47,925 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 23:32:47,925 INFO L82 PathProgramCache]: Analyzing trace with hash 1460544723, now seen corresponding path program 1 times [2020-11-29 23:32:47,925 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 23:32:47,925 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1939103871] [2020-11-29 23:32:47,926 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 23:32:47,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 23:32:48,072 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-29 23:32:48,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 23:32:48,130 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-11-29 23:32:48,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 23:32:48,157 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-11-29 23:32:48,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 23:32:48,183 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2020-11-29 23:32:48,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 23:32:48,243 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-29 23:32:48,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 23:32:48,352 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-11-29 23:32:48,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 23:32:48,472 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-11-29 23:32:48,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 23:32:48,579 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-29 23:32:48,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 23:32:48,581 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-11-29 23:32:48,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 23:32:48,615 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2020-11-29 23:32:48,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 23:32:48,619 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2020-11-29 23:32:48,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 23:32:48,651 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 23:32:48,651 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1939103871] [2020-11-29 23:32:48,651 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-29 23:32:48,652 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [23] imperfect sequences [] total 23 [2020-11-29 23:32:48,653 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [521302112] [2020-11-29 23:32:48,654 INFO L461 AbstractCegarLoop]: Interpolant automaton has 23 states [2020-11-29 23:32:48,654 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 23:32:48,654 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2020-11-29 23:32:48,655 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=440, Unknown=0, NotChecked=0, Total=506 [2020-11-29 23:32:48,655 INFO L87 Difference]: Start difference. First operand 473 states and 665 transitions. Second operand 23 states. [2020-11-29 23:32:49,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 23:32:49,500 INFO L93 Difference]: Finished difference Result 514 states and 725 transitions. [2020-11-29 23:32:49,500 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2020-11-29 23:32:49,501 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 93 [2020-11-29 23:32:49,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 23:32:49,503 INFO L225 Difference]: With dead ends: 514 [2020-11-29 23:32:49,504 INFO L226 Difference]: Without dead ends: 492 [2020-11-29 23:32:49,504 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=82, Invalid=620, Unknown=0, NotChecked=0, Total=702 [2020-11-29 23:32:49,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 492 states. [2020-11-29 23:32:49,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 492 to 484. [2020-11-29 23:32:49,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 484 states. [2020-11-29 23:32:49,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 484 states to 484 states and 680 transitions. [2020-11-29 23:32:49,519 INFO L78 Accepts]: Start accepts. Automaton has 484 states and 680 transitions. Word has length 93 [2020-11-29 23:32:49,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 23:32:49,520 INFO L481 AbstractCegarLoop]: Abstraction has 484 states and 680 transitions. [2020-11-29 23:32:49,520 INFO L482 AbstractCegarLoop]: Interpolant automaton has 23 states. [2020-11-29 23:32:49,520 INFO L276 IsEmpty]: Start isEmpty. Operand 484 states and 680 transitions. [2020-11-29 23:32:49,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2020-11-29 23:32:49,522 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 23:32:49,522 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] [2020-11-29 23:32:49,522 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2020-11-29 23:32:49,523 INFO L429 AbstractCegarLoop]: === Iteration 38 === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr0ENSURES_VIOLATIONMEMORY_LEAK]=== [2020-11-29 23:32:49,523 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 23:32:49,523 INFO L82 PathProgramCache]: Analyzing trace with hash 443009802, now seen corresponding path program 1 times [2020-11-29 23:32:49,523 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 23:32:49,524 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2087356352] [2020-11-29 23:32:49,524 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 23:32:49,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 23:32:49,682 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-29 23:32:49,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 23:32:49,747 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-11-29 23:32:49,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 23:32:49,774 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-11-29 23:32:49,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 23:32:49,804 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2020-11-29 23:32:49,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 23:32:49,860 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-29 23:32:49,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 23:32:49,966 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-11-29 23:32:49,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 23:32:50,084 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-11-29 23:32:50,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 23:32:50,173 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-29 23:32:50,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 23:32:50,176 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-11-29 23:32:50,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 23:32:50,211 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2020-11-29 23:32:50,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 23:32:50,216 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2020-11-29 23:32:50,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 23:32:50,250 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 23:32:50,250 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2087356352] [2020-11-29 23:32:50,250 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-29 23:32:50,250 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [23] imperfect sequences [] total 23 [2020-11-29 23:32:50,250 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1630721521] [2020-11-29 23:32:50,252 INFO L461 AbstractCegarLoop]: Interpolant automaton has 23 states [2020-11-29 23:32:50,253 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 23:32:50,253 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2020-11-29 23:32:50,254 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=440, Unknown=0, NotChecked=0, Total=506 [2020-11-29 23:32:50,254 INFO L87 Difference]: Start difference. First operand 484 states and 680 transitions. Second operand 23 states. [2020-11-29 23:32:52,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 23:32:52,163 INFO L93 Difference]: Finished difference Result 512 states and 721 transitions. [2020-11-29 23:32:52,164 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2020-11-29 23:32:52,164 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 94 [2020-11-29 23:32:52,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 23:32:52,168 INFO L225 Difference]: With dead ends: 512 [2020-11-29 23:32:52,168 INFO L226 Difference]: Without dead ends: 490 [2020-11-29 23:32:52,169 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=82, Invalid=620, Unknown=0, NotChecked=0, Total=702 [2020-11-29 23:32:52,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 490 states. [2020-11-29 23:32:52,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 490 to 471. [2020-11-29 23:32:52,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 471 states. [2020-11-29 23:32:52,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 471 states to 471 states and 661 transitions. [2020-11-29 23:32:52,183 INFO L78 Accepts]: Start accepts. Automaton has 471 states and 661 transitions. Word has length 94 [2020-11-29 23:32:52,184 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 23:32:52,184 INFO L481 AbstractCegarLoop]: Abstraction has 471 states and 661 transitions. [2020-11-29 23:32:52,184 INFO L482 AbstractCegarLoop]: Interpolant automaton has 23 states. [2020-11-29 23:32:52,184 INFO L276 IsEmpty]: Start isEmpty. Operand 471 states and 661 transitions. [2020-11-29 23:32:52,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2020-11-29 23:32:52,186 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 23:32:52,186 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] [2020-11-29 23:32:52,186 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2020-11-29 23:32:52,186 INFO L429 AbstractCegarLoop]: === Iteration 39 === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr0ENSURES_VIOLATIONMEMORY_LEAK]=== [2020-11-29 23:32:52,186 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 23:32:52,186 INFO L82 PathProgramCache]: Analyzing trace with hash 1300800796, now seen corresponding path program 1 times [2020-11-29 23:32:52,187 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 23:32:52,187 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [43499921] [2020-11-29 23:32:52,187 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 23:32:52,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 23:32:52,362 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-29 23:32:52,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 23:32:52,414 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-11-29 23:32:52,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 23:32:52,435 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-11-29 23:32:52,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 23:32:52,459 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2020-11-29 23:32:52,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 23:32:52,552 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-29 23:32:52,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 23:32:52,667 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-11-29 23:32:52,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 23:32:52,767 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-11-29 23:32:52,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 23:32:52,800 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-29 23:32:52,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 23:32:52,803 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-11-29 23:32:52,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 23:32:52,838 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2020-11-29 23:32:52,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 23:32:52,877 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2020-11-29 23:32:52,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 23:32:52,882 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2020-11-29 23:32:52,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 23:32:52,919 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 23:32:52,919 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [43499921] [2020-11-29 23:32:52,919 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-29 23:32:52,920 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [23] imperfect sequences [] total 23 [2020-11-29 23:32:52,920 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [860884507] [2020-11-29 23:32:52,920 INFO L461 AbstractCegarLoop]: Interpolant automaton has 23 states [2020-11-29 23:32:52,921 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 23:32:52,921 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2020-11-29 23:32:52,921 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=431, Unknown=0, NotChecked=0, Total=506 [2020-11-29 23:32:52,922 INFO L87 Difference]: Start difference. First operand 471 states and 661 transitions. Second operand 23 states. [2020-11-29 23:32:55,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 23:32:55,778 INFO L93 Difference]: Finished difference Result 922 states and 1299 transitions. [2020-11-29 23:32:55,779 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2020-11-29 23:32:55,779 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 104 [2020-11-29 23:32:55,779 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 23:32:55,783 INFO L225 Difference]: With dead ends: 922 [2020-11-29 23:32:55,783 INFO L226 Difference]: Without dead ends: 889 [2020-11-29 23:32:55,784 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 424 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=289, Invalid=2261, Unknown=0, NotChecked=0, Total=2550 [2020-11-29 23:32:55,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 889 states. [2020-11-29 23:32:55,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 889 to 878. [2020-11-29 23:32:55,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 878 states. [2020-11-29 23:32:55,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 878 states to 878 states and 1254 transitions. [2020-11-29 23:32:55,811 INFO L78 Accepts]: Start accepts. Automaton has 878 states and 1254 transitions. Word has length 104 [2020-11-29 23:32:55,811 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 23:32:55,812 INFO L481 AbstractCegarLoop]: Abstraction has 878 states and 1254 transitions. [2020-11-29 23:32:55,812 INFO L482 AbstractCegarLoop]: Interpolant automaton has 23 states. [2020-11-29 23:32:55,812 INFO L276 IsEmpty]: Start isEmpty. Operand 878 states and 1254 transitions. [2020-11-29 23:32:55,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2020-11-29 23:32:55,814 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 23:32:55,814 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] [2020-11-29 23:32:55,815 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2020-11-29 23:32:55,815 INFO L429 AbstractCegarLoop]: === Iteration 40 === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr0ENSURES_VIOLATIONMEMORY_LEAK]=== [2020-11-29 23:32:55,815 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 23:32:55,815 INFO L82 PathProgramCache]: Analyzing trace with hash 417291806, now seen corresponding path program 1 times [2020-11-29 23:32:55,816 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 23:32:55,816 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1814800061] [2020-11-29 23:32:55,816 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 23:32:55,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 23:32:55,954 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-29 23:32:55,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 23:32:56,031 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-11-29 23:32:56,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 23:32:56,063 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-11-29 23:32:56,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 23:32:56,095 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2020-11-29 23:32:56,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 23:32:56,195 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-29 23:32:56,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 23:32:56,311 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-11-29 23:32:56,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 23:32:56,410 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-11-29 23:32:56,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 23:32:56,447 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-29 23:32:56,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 23:32:56,450 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-11-29 23:32:56,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 23:32:56,482 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2020-11-29 23:32:56,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 23:32:56,522 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2020-11-29 23:32:56,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 23:32:56,527 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2020-11-29 23:32:56,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 23:32:56,562 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 23:32:56,563 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1814800061] [2020-11-29 23:32:56,563 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-29 23:32:56,563 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [23] imperfect sequences [] total 23 [2020-11-29 23:32:56,563 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [962704836] [2020-11-29 23:32:56,564 INFO L461 AbstractCegarLoop]: Interpolant automaton has 23 states [2020-11-29 23:32:56,564 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 23:32:56,564 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2020-11-29 23:32:56,565 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=431, Unknown=0, NotChecked=0, Total=506 [2020-11-29 23:32:56,565 INFO L87 Difference]: Start difference. First operand 878 states and 1254 transitions. Second operand 23 states. [2020-11-29 23:32:59,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 23:32:59,777 INFO L93 Difference]: Finished difference Result 909 states and 1283 transitions. [2020-11-29 23:32:59,778 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2020-11-29 23:32:59,778 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 104 [2020-11-29 23:32:59,778 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 23:32:59,783 INFO L225 Difference]: With dead ends: 909 [2020-11-29 23:32:59,784 INFO L226 Difference]: Without dead ends: 876 [2020-11-29 23:32:59,785 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 263 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=257, Invalid=1723, Unknown=0, NotChecked=0, Total=1980 [2020-11-29 23:32:59,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 876 states. [2020-11-29 23:32:59,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 876 to 461. [2020-11-29 23:32:59,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 461 states. [2020-11-29 23:32:59,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 461 states to 461 states and 648 transitions. [2020-11-29 23:32:59,802 INFO L78 Accepts]: Start accepts. Automaton has 461 states and 648 transitions. Word has length 104 [2020-11-29 23:32:59,802 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 23:32:59,802 INFO L481 AbstractCegarLoop]: Abstraction has 461 states and 648 transitions. [2020-11-29 23:32:59,802 INFO L482 AbstractCegarLoop]: Interpolant automaton has 23 states. [2020-11-29 23:32:59,802 INFO L276 IsEmpty]: Start isEmpty. Operand 461 states and 648 transitions. [2020-11-29 23:32:59,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2020-11-29 23:32:59,805 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 23:32:59,805 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] [2020-11-29 23:32:59,805 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2020-11-29 23:32:59,805 INFO L429 AbstractCegarLoop]: === Iteration 41 === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr0ENSURES_VIOLATIONMEMORY_LEAK]=== [2020-11-29 23:32:59,806 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 23:32:59,806 INFO L82 PathProgramCache]: Analyzing trace with hash 343277445, now seen corresponding path program 1 times [2020-11-29 23:32:59,806 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 23:32:59,806 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1469905640] [2020-11-29 23:32:59,806 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 23:32:59,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 23:32:59,981 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-29 23:32:59,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 23:33:00,026 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-11-29 23:33:00,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 23:33:00,054 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-11-29 23:33:00,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 23:33:00,096 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2020-11-29 23:33:00,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 23:33:00,166 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-29 23:33:00,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 23:33:00,288 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-11-29 23:33:00,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 23:33:00,406 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-11-29 23:33:00,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 23:33:00,522 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-29 23:33:00,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 23:33:00,524 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-11-29 23:33:00,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 23:33:00,557 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2020-11-29 23:33:00,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 23:33:00,561 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2020-11-29 23:33:00,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 23:33:00,612 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2020-11-29 23:33:00,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 23:33:00,652 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-11-29 23:33:00,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 23:33:00,654 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2020-11-29 23:33:00,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 23:33:00,687 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 23:33:00,687 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1469905640] [2020-11-29 23:33:00,688 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-29 23:33:00,688 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [25] imperfect sequences [] total 25 [2020-11-29 23:33:00,688 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1582260820] [2020-11-29 23:33:00,688 INFO L461 AbstractCegarLoop]: Interpolant automaton has 25 states [2020-11-29 23:33:00,689 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 23:33:00,689 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2020-11-29 23:33:00,689 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=516, Unknown=0, NotChecked=0, Total=600 [2020-11-29 23:33:00,689 INFO L87 Difference]: Start difference. First operand 461 states and 648 transitions. Second operand 25 states. [2020-11-29 23:33:01,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 23:33:01,772 INFO L93 Difference]: Finished difference Result 509 states and 723 transitions. [2020-11-29 23:33:01,779 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2020-11-29 23:33:01,779 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 109 [2020-11-29 23:33:01,779 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 23:33:01,782 INFO L225 Difference]: With dead ends: 509 [2020-11-29 23:33:01,783 INFO L226 Difference]: Without dead ends: 485 [2020-11-29 23:33:01,783 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 113 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=144, Invalid=1116, Unknown=0, NotChecked=0, Total=1260 [2020-11-29 23:33:01,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 485 states. [2020-11-29 23:33:01,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 485 to 477. [2020-11-29 23:33:01,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 477 states. [2020-11-29 23:33:01,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 477 states to 477 states and 671 transitions. [2020-11-29 23:33:01,797 INFO L78 Accepts]: Start accepts. Automaton has 477 states and 671 transitions. Word has length 109 [2020-11-29 23:33:01,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 23:33:01,797 INFO L481 AbstractCegarLoop]: Abstraction has 477 states and 671 transitions. [2020-11-29 23:33:01,797 INFO L482 AbstractCegarLoop]: Interpolant automaton has 25 states. [2020-11-29 23:33:01,797 INFO L276 IsEmpty]: Start isEmpty. Operand 477 states and 671 transitions. [2020-11-29 23:33:01,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2020-11-29 23:33:01,799 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 23:33:01,799 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] [2020-11-29 23:33:01,799 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2020-11-29 23:33:01,800 INFO L429 AbstractCegarLoop]: === Iteration 42 === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr0ENSURES_VIOLATIONMEMORY_LEAK]=== [2020-11-29 23:33:01,800 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 23:33:01,800 INFO L82 PathProgramCache]: Analyzing trace with hash 1625241168, now seen corresponding path program 1 times [2020-11-29 23:33:01,800 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 23:33:01,801 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [483337086] [2020-11-29 23:33:01,801 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 23:33:01,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 23:33:01,921 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-29 23:33:01,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 23:33:01,970 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-11-29 23:33:01,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 23:33:01,997 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-11-29 23:33:01,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 23:33:02,022 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2020-11-29 23:33:02,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 23:33:02,083 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-29 23:33:02,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 23:33:02,176 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-11-29 23:33:02,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 23:33:02,275 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-11-29 23:33:02,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 23:33:02,344 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-29 23:33:02,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 23:33:02,346 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-11-29 23:33:02,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 23:33:02,372 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2020-11-29 23:33:02,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 23:33:02,375 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2020-11-29 23:33:02,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 23:33:02,421 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2020-11-29 23:33:02,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 23:33:02,453 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-11-29 23:33:02,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 23:33:02,456 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2020-11-29 23:33:02,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 23:33:02,492 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 23:33:02,492 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [483337086] [2020-11-29 23:33:02,493 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-29 23:33:02,493 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [25] imperfect sequences [] total 25 [2020-11-29 23:33:02,493 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1882877489] [2020-11-29 23:33:02,494 INFO L461 AbstractCegarLoop]: Interpolant automaton has 25 states [2020-11-29 23:33:02,494 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 23:33:02,495 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2020-11-29 23:33:02,495 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=516, Unknown=0, NotChecked=0, Total=600 [2020-11-29 23:33:02,495 INFO L87 Difference]: Start difference. First operand 477 states and 671 transitions. Second operand 25 states. [2020-11-29 23:33:03,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 23:33:03,503 INFO L93 Difference]: Finished difference Result 511 states and 721 transitions. [2020-11-29 23:33:03,504 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2020-11-29 23:33:03,504 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 110 [2020-11-29 23:33:03,504 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 23:33:03,507 INFO L225 Difference]: With dead ends: 511 [2020-11-29 23:33:03,507 INFO L226 Difference]: Without dead ends: 474 [2020-11-29 23:33:03,508 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 113 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=144, Invalid=1116, Unknown=0, NotChecked=0, Total=1260 [2020-11-29 23:33:03,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 474 states. [2020-11-29 23:33:03,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 474 to 450. [2020-11-29 23:33:03,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 450 states. [2020-11-29 23:33:03,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 450 states to 450 states and 613 transitions. [2020-11-29 23:33:03,522 INFO L78 Accepts]: Start accepts. Automaton has 450 states and 613 transitions. Word has length 110 [2020-11-29 23:33:03,522 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 23:33:03,522 INFO L481 AbstractCegarLoop]: Abstraction has 450 states and 613 transitions. [2020-11-29 23:33:03,523 INFO L482 AbstractCegarLoop]: Interpolant automaton has 25 states. [2020-11-29 23:33:03,523 INFO L276 IsEmpty]: Start isEmpty. Operand 450 states and 613 transitions. [2020-11-29 23:33:03,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2020-11-29 23:33:03,525 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 23:33:03,525 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 23:33:03,525 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2020-11-29 23:33:03,525 INFO L429 AbstractCegarLoop]: === Iteration 43 === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr0ENSURES_VIOLATIONMEMORY_LEAK]=== [2020-11-29 23:33:03,526 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 23:33:03,526 INFO L82 PathProgramCache]: Analyzing trace with hash -2144481636, now seen corresponding path program 1 times [2020-11-29 23:33:03,526 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 23:33:03,526 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [467517663] [2020-11-29 23:33:03,526 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 23:33:03,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 23:33:03,635 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-29 23:33:03,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 23:33:03,665 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-11-29 23:33:03,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 23:33:03,696 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-11-29 23:33:03,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 23:33:03,710 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2020-11-29 23:33:03,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 23:33:03,725 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-11-29 23:33:03,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 23:33:03,737 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-29 23:33:03,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 23:33:03,739 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-11-29 23:33:03,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 23:33:03,771 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2020-11-29 23:33:03,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 23:33:03,773 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2020-11-29 23:33:03,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 23:33:03,787 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2020-11-29 23:33:03,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 23:33:03,823 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-11-29 23:33:03,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 23:33:03,824 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2020-11-29 23:33:03,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 23:33:03,848 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-29 23:33:03,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 23:33:03,850 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-11-29 23:33:03,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 23:33:03,852 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2020-11-29 23:33:03,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 23:33:03,896 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2020-11-29 23:33:03,897 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [467517663] [2020-11-29 23:33:03,897 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-29 23:33:03,897 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2020-11-29 23:33:03,897 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2058715351] [2020-11-29 23:33:03,897 INFO L461 AbstractCegarLoop]: Interpolant automaton has 15 states [2020-11-29 23:33:03,897 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 23:33:03,898 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2020-11-29 23:33:03,898 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=153, Unknown=0, NotChecked=0, Total=210 [2020-11-29 23:33:03,898 INFO L87 Difference]: Start difference. First operand 450 states and 613 transitions. Second operand 15 states. [2020-11-29 23:33:04,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 23:33:04,507 INFO L93 Difference]: Finished difference Result 451 states and 602 transitions. [2020-11-29 23:33:04,507 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-11-29 23:33:04,507 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 122 [2020-11-29 23:33:04,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 23:33:04,509 INFO L225 Difference]: With dead ends: 451 [2020-11-29 23:33:04,510 INFO L226 Difference]: Without dead ends: 451 [2020-11-29 23:33:04,510 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=85, Invalid=257, Unknown=0, NotChecked=0, Total=342 [2020-11-29 23:33:04,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 451 states. [2020-11-29 23:33:04,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 451 to 445. [2020-11-29 23:33:04,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 445 states. [2020-11-29 23:33:04,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 445 states to 445 states and 596 transitions. [2020-11-29 23:33:04,520 INFO L78 Accepts]: Start accepts. Automaton has 445 states and 596 transitions. Word has length 122 [2020-11-29 23:33:04,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 23:33:04,520 INFO L481 AbstractCegarLoop]: Abstraction has 445 states and 596 transitions. [2020-11-29 23:33:04,520 INFO L482 AbstractCegarLoop]: Interpolant automaton has 15 states. [2020-11-29 23:33:04,520 INFO L276 IsEmpty]: Start isEmpty. Operand 445 states and 596 transitions. [2020-11-29 23:33:04,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2020-11-29 23:33:04,522 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 23:33:04,523 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 23:33:04,523 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2020-11-29 23:33:04,523 INFO L429 AbstractCegarLoop]: === Iteration 44 === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr0ENSURES_VIOLATIONMEMORY_LEAK]=== [2020-11-29 23:33:04,523 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 23:33:04,524 INFO L82 PathProgramCache]: Analyzing trace with hash -728283964, now seen corresponding path program 1 times [2020-11-29 23:33:04,524 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 23:33:04,524 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1472449743] [2020-11-29 23:33:04,524 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 23:33:04,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 23:33:04,635 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-29 23:33:04,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 23:33:04,663 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-11-29 23:33:04,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 23:33:04,680 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-11-29 23:33:04,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 23:33:04,705 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2020-11-29 23:33:04,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 23:33:04,727 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-11-29 23:33:04,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 23:33:04,736 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-29 23:33:04,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 23:33:04,738 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-11-29 23:33:04,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 23:33:04,748 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2020-11-29 23:33:04,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 23:33:04,750 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2020-11-29 23:33:04,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 23:33:04,770 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2020-11-29 23:33:04,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 23:33:04,846 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-11-29 23:33:04,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 23:33:04,848 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2020-11-29 23:33:04,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 23:33:04,882 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-29 23:33:04,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 23:33:04,894 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-11-29 23:33:04,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 23:33:04,895 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2020-11-29 23:33:04,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 23:33:04,920 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2020-11-29 23:33:04,921 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1472449743] [2020-11-29 23:33:04,921 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-29 23:33:04,921 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2020-11-29 23:33:04,921 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1618884655] [2020-11-29 23:33:04,922 INFO L461 AbstractCegarLoop]: Interpolant automaton has 15 states [2020-11-29 23:33:04,922 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 23:33:04,922 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2020-11-29 23:33:04,922 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=153, Unknown=0, NotChecked=0, Total=210 [2020-11-29 23:33:04,923 INFO L87 Difference]: Start difference. First operand 445 states and 596 transitions. Second operand 15 states. [2020-11-29 23:33:05,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 23:33:05,916 INFO L93 Difference]: Finished difference Result 594 states and 855 transitions. [2020-11-29 23:33:05,916 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-11-29 23:33:05,916 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 123 [2020-11-29 23:33:05,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 23:33:05,920 INFO L225 Difference]: With dead ends: 594 [2020-11-29 23:33:05,920 INFO L226 Difference]: Without dead ends: 594 [2020-11-29 23:33:05,921 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=85, Invalid=257, Unknown=0, NotChecked=0, Total=342 [2020-11-29 23:33:05,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 594 states. [2020-11-29 23:33:05,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 594 to 436. [2020-11-29 23:33:05,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 436 states. [2020-11-29 23:33:05,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 436 states to 436 states and 585 transitions. [2020-11-29 23:33:05,935 INFO L78 Accepts]: Start accepts. Automaton has 436 states and 585 transitions. Word has length 123 [2020-11-29 23:33:05,935 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 23:33:05,935 INFO L481 AbstractCegarLoop]: Abstraction has 436 states and 585 transitions. [2020-11-29 23:33:05,935 INFO L482 AbstractCegarLoop]: Interpolant automaton has 15 states. [2020-11-29 23:33:05,936 INFO L276 IsEmpty]: Start isEmpty. Operand 436 states and 585 transitions. [2020-11-29 23:33:05,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2020-11-29 23:33:05,937 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 23:33:05,938 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, 1, 1] [2020-11-29 23:33:05,938 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2020-11-29 23:33:05,938 INFO L429 AbstractCegarLoop]: === Iteration 45 === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr0ENSURES_VIOLATIONMEMORY_LEAK]=== [2020-11-29 23:33:05,938 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 23:33:05,939 INFO L82 PathProgramCache]: Analyzing trace with hash -1329482434, now seen corresponding path program 1 times [2020-11-29 23:33:05,939 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 23:33:05,939 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1197616690] [2020-11-29 23:33:05,939 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 23:33:05,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 23:33:06,084 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-29 23:33:06,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 23:33:06,115 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-11-29 23:33:06,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 23:33:06,140 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-11-29 23:33:06,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 23:33:06,159 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2020-11-29 23:33:06,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 23:33:06,257 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-29 23:33:06,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 23:33:06,384 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-11-29 23:33:06,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 23:33:06,478 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-11-29 23:33:06,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 23:33:06,507 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-29 23:33:06,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 23:33:06,509 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-11-29 23:33:06,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 23:33:06,540 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2020-11-29 23:33:06,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 23:33:06,576 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2020-11-29 23:33:06,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 23:33:06,581 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2020-11-29 23:33:06,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 23:33:06,624 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2020-11-29 23:33:06,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 23:33:06,649 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-11-29 23:33:06,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 23:33:06,650 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2020-11-29 23:33:06,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 23:33:06,689 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 23:33:06,689 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1197616690] [2020-11-29 23:33:06,689 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-29 23:33:06,690 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [25] imperfect sequences [] total 25 [2020-11-29 23:33:06,690 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1536994107] [2020-11-29 23:33:06,690 INFO L461 AbstractCegarLoop]: Interpolant automaton has 25 states [2020-11-29 23:33:06,690 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 23:33:06,690 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2020-11-29 23:33:06,690 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=505, Unknown=0, NotChecked=0, Total=600 [2020-11-29 23:33:06,691 INFO L87 Difference]: Start difference. First operand 436 states and 585 transitions. Second operand 25 states. [2020-11-29 23:33:09,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 23:33:09,146 INFO L93 Difference]: Finished difference Result 862 states and 1158 transitions. [2020-11-29 23:33:09,146 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2020-11-29 23:33:09,146 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 120 [2020-11-29 23:33:09,146 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 23:33:09,150 INFO L225 Difference]: With dead ends: 862 [2020-11-29 23:33:09,150 INFO L226 Difference]: Without dead ends: 805 [2020-11-29 23:33:09,152 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 617 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=377, Invalid=2929, Unknown=0, NotChecked=0, Total=3306 [2020-11-29 23:33:09,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 805 states. [2020-11-29 23:33:09,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 805 to 797. [2020-11-29 23:33:09,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 797 states. [2020-11-29 23:33:09,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 797 states to 797 states and 1055 transitions. [2020-11-29 23:33:09,174 INFO L78 Accepts]: Start accepts. Automaton has 797 states and 1055 transitions. Word has length 120 [2020-11-29 23:33:09,174 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 23:33:09,174 INFO L481 AbstractCegarLoop]: Abstraction has 797 states and 1055 transitions. [2020-11-29 23:33:09,174 INFO L482 AbstractCegarLoop]: Interpolant automaton has 25 states. [2020-11-29 23:33:09,174 INFO L276 IsEmpty]: Start isEmpty. Operand 797 states and 1055 transitions. [2020-11-29 23:33:09,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2020-11-29 23:33:09,176 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 23:33:09,177 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, 1, 1] [2020-11-29 23:33:09,177 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2020-11-29 23:33:09,177 INFO L429 AbstractCegarLoop]: === Iteration 46 === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr0ENSURES_VIOLATIONMEMORY_LEAK]=== [2020-11-29 23:33:09,177 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 23:33:09,177 INFO L82 PathProgramCache]: Analyzing trace with hash 1926900288, now seen corresponding path program 1 times [2020-11-29 23:33:09,178 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 23:33:09,178 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [447748816] [2020-11-29 23:33:09,178 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 23:33:09,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 23:33:09,320 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-29 23:33:09,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 23:33:09,364 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-11-29 23:33:09,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 23:33:09,389 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-11-29 23:33:09,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 23:33:09,426 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2020-11-29 23:33:09,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 23:33:09,522 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-29 23:33:09,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 23:33:09,638 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-11-29 23:33:09,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 23:33:09,722 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-11-29 23:33:09,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 23:33:09,742 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-29 23:33:09,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 23:33:09,744 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-11-29 23:33:09,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 23:33:09,825 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2020-11-29 23:33:09,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 23:33:09,851 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2020-11-29 23:33:09,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 23:33:09,853 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2020-11-29 23:33:09,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 23:33:09,887 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2020-11-29 23:33:09,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 23:33:09,914 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-11-29 23:33:09,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 23:33:09,916 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2020-11-29 23:33:09,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 23:33:09,943 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 23:33:09,943 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [447748816] [2020-11-29 23:33:09,943 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-29 23:33:09,943 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [25] imperfect sequences [] total 25 [2020-11-29 23:33:09,943 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [657041460] [2020-11-29 23:33:09,944 INFO L461 AbstractCegarLoop]: Interpolant automaton has 25 states [2020-11-29 23:33:09,944 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 23:33:09,944 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2020-11-29 23:33:09,944 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=505, Unknown=0, NotChecked=0, Total=600 [2020-11-29 23:33:09,945 INFO L87 Difference]: Start difference. First operand 797 states and 1055 transitions. Second operand 25 states. [2020-11-29 23:33:13,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 23:33:13,140 INFO L93 Difference]: Finished difference Result 803 states and 1059 transitions. [2020-11-29 23:33:13,140 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2020-11-29 23:33:13,140 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 120 [2020-11-29 23:33:13,141 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 23:33:13,144 INFO L225 Difference]: With dead ends: 803 [2020-11-29 23:33:13,144 INFO L226 Difference]: Without dead ends: 746 [2020-11-29 23:33:13,145 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 397 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=341, Invalid=2209, Unknown=0, NotChecked=0, Total=2550 [2020-11-29 23:33:13,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 746 states. [2020-11-29 23:33:13,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 746 to 378. [2020-11-29 23:33:13,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 378 states. [2020-11-29 23:33:13,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 378 states to 378 states and 487 transitions. [2020-11-29 23:33:13,159 INFO L78 Accepts]: Start accepts. Automaton has 378 states and 487 transitions. Word has length 120 [2020-11-29 23:33:13,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 23:33:13,159 INFO L481 AbstractCegarLoop]: Abstraction has 378 states and 487 transitions. [2020-11-29 23:33:13,160 INFO L482 AbstractCegarLoop]: Interpolant automaton has 25 states. [2020-11-29 23:33:13,160 INFO L276 IsEmpty]: Start isEmpty. Operand 378 states and 487 transitions. [2020-11-29 23:33:13,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2020-11-29 23:33:13,162 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 23:33:13,162 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-29 23:33:13,162 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45 [2020-11-29 23:33:13,162 INFO L429 AbstractCegarLoop]: === Iteration 47 === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr0ENSURES_VIOLATIONMEMORY_LEAK]=== [2020-11-29 23:33:13,163 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 23:33:13,163 INFO L82 PathProgramCache]: Analyzing trace with hash 1850620561, now seen corresponding path program 1 times [2020-11-29 23:33:13,163 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 23:33:13,163 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1602372929] [2020-11-29 23:33:13,163 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 23:33:13,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 23:33:13,293 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-29 23:33:13,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 23:33:13,335 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-11-29 23:33:13,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 23:33:13,357 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-11-29 23:33:13,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 23:33:13,377 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2020-11-29 23:33:13,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 23:33:13,410 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-11-29 23:33:13,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 23:33:13,423 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-29 23:33:13,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 23:33:13,425 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-11-29 23:33:13,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 23:33:13,437 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2020-11-29 23:33:13,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 23:33:13,441 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2020-11-29 23:33:13,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 23:33:13,460 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2020-11-29 23:33:13,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 23:33:13,498 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-11-29 23:33:13,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 23:33:13,500 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2020-11-29 23:33:13,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 23:33:13,504 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-29 23:33:13,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 23:33:13,506 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-11-29 23:33:13,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 23:33:13,508 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2020-11-29 23:33:13,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 23:33:13,510 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2020-11-29 23:33:13,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 23:33:13,513 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2020-11-29 23:33:13,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 23:33:13,519 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-29 23:33:13,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 23:33:13,530 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-11-29 23:33:13,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 23:33:13,533 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2020-11-29 23:33:13,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 23:33:13,563 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 87 trivial. 0 not checked. [2020-11-29 23:33:13,563 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1602372929] [2020-11-29 23:33:13,563 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-29 23:33:13,564 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-11-29 23:33:13,564 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [100251586] [2020-11-29 23:33:13,564 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-11-29 23:33:13,564 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 23:33:13,565 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-11-29 23:33:13,565 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=81, Unknown=0, NotChecked=0, Total=132 [2020-11-29 23:33:13,565 INFO L87 Difference]: Start difference. First operand 378 states and 487 transitions. Second operand 12 states. [2020-11-29 23:33:14,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 23:33:14,023 INFO L93 Difference]: Finished difference Result 378 states and 485 transitions. [2020-11-29 23:33:14,023 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-11-29 23:33:14,023 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 164 [2020-11-29 23:33:14,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 23:33:14,025 INFO L225 Difference]: With dead ends: 378 [2020-11-29 23:33:14,025 INFO L226 Difference]: Without dead ends: 378 [2020-11-29 23:33:14,025 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=69, Invalid=113, Unknown=0, NotChecked=0, Total=182 [2020-11-29 23:33:14,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 378 states. [2020-11-29 23:33:14,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 378 to 378. [2020-11-29 23:33:14,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 378 states. [2020-11-29 23:33:14,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 378 states to 378 states and 485 transitions. [2020-11-29 23:33:14,033 INFO L78 Accepts]: Start accepts. Automaton has 378 states and 485 transitions. Word has length 164 [2020-11-29 23:33:14,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 23:33:14,033 INFO L481 AbstractCegarLoop]: Abstraction has 378 states and 485 transitions. [2020-11-29 23:33:14,033 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-11-29 23:33:14,034 INFO L276 IsEmpty]: Start isEmpty. Operand 378 states and 485 transitions. [2020-11-29 23:33:14,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2020-11-29 23:33:14,036 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 23:33:14,036 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-29 23:33:14,036 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46 [2020-11-29 23:33:14,036 INFO L429 AbstractCegarLoop]: === Iteration 48 === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr0ENSURES_VIOLATIONMEMORY_LEAK]=== [2020-11-29 23:33:14,037 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 23:33:14,037 INFO L82 PathProgramCache]: Analyzing trace with hash 747553008, now seen corresponding path program 1 times [2020-11-29 23:33:14,037 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 23:33:14,037 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1367462647] [2020-11-29 23:33:14,037 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 23:33:14,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 23:33:14,163 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-29 23:33:14,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 23:33:14,229 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-11-29 23:33:14,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 23:33:14,244 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-11-29 23:33:14,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 23:33:14,259 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2020-11-29 23:33:14,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 23:33:14,274 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-11-29 23:33:14,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 23:33:14,284 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-29 23:33:14,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 23:33:14,285 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-11-29 23:33:14,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 23:33:14,294 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2020-11-29 23:33:14,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 23:33:14,296 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2020-11-29 23:33:14,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 23:33:14,309 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2020-11-29 23:33:14,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 23:33:14,392 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-11-29 23:33:14,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 23:33:14,394 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2020-11-29 23:33:14,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 23:33:14,433 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-29 23:33:14,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 23:33:14,435 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-11-29 23:33:14,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 23:33:14,436 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2020-11-29 23:33:14,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 23:33:14,438 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2020-11-29 23:33:14,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 23:33:14,440 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2020-11-29 23:33:14,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 23:33:14,445 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-29 23:33:14,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 23:33:14,446 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-11-29 23:33:14,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 23:33:14,448 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2020-11-29 23:33:14,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 23:33:14,486 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2020-11-29 23:33:14,487 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1367462647] [2020-11-29 23:33:14,487 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1942866535] [2020-11-29 23:33:14,487 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_27253434-b648-4f77-a9cd-bcc7a4e89299/bin/uautomizer/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-29 23:33:14,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 23:33:14,768 INFO L263 TraceCheckSpWp]: Trace formula consists of 1362 conjuncts, 5 conjunts are in the unsatisfiable core [2020-11-29 23:33:14,781 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-29 23:33:14,858 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 65 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2020-11-29 23:33:14,859 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2020-11-29 23:33:14,859 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [15] total 15 [2020-11-29 23:33:14,859 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1189325181] [2020-11-29 23:33:14,860 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-11-29 23:33:14,860 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 23:33:14,861 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-11-29 23:33:14,861 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=153, Unknown=0, NotChecked=0, Total=210 [2020-11-29 23:33:14,861 INFO L87 Difference]: Start difference. First operand 378 states and 485 transitions. Second operand 6 states. [2020-11-29 23:33:15,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 23:33:15,088 INFO L93 Difference]: Finished difference Result 413 states and 536 transitions. [2020-11-29 23:33:15,088 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-11-29 23:33:15,088 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 164 [2020-11-29 23:33:15,089 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 23:33:15,091 INFO L225 Difference]: With dead ends: 413 [2020-11-29 23:33:15,091 INFO L226 Difference]: Without dead ends: 411 [2020-11-29 23:33:15,092 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 211 GetRequests, 197 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=61, Invalid=179, Unknown=0, NotChecked=0, Total=240 [2020-11-29 23:33:15,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 411 states. [2020-11-29 23:33:15,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 411 to 398. [2020-11-29 23:33:15,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 398 states. [2020-11-29 23:33:15,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 398 states to 398 states and 514 transitions. [2020-11-29 23:33:15,126 INFO L78 Accepts]: Start accepts. Automaton has 398 states and 514 transitions. Word has length 164 [2020-11-29 23:33:15,126 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 23:33:15,127 INFO L481 AbstractCegarLoop]: Abstraction has 398 states and 514 transitions. [2020-11-29 23:33:15,127 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-11-29 23:33:15,127 INFO L276 IsEmpty]: Start isEmpty. Operand 398 states and 514 transitions. [2020-11-29 23:33:15,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2020-11-29 23:33:15,129 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 23:33:15,129 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-29 23:33:15,356 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable47 [2020-11-29 23:33:15,356 INFO L429 AbstractCegarLoop]: === Iteration 49 === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr0ENSURES_VIOLATIONMEMORY_LEAK]=== [2020-11-29 23:33:15,357 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 23:33:15,357 INFO L82 PathProgramCache]: Analyzing trace with hash 1500172307, now seen corresponding path program 1 times [2020-11-29 23:33:15,357 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 23:33:15,357 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [588587552] [2020-11-29 23:33:15,357 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 23:33:15,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 23:33:15,525 WARN L193 SmtUtils]: Spent 103.00 ms on a formula simplification that was a NOOP. DAG size: 91 [2020-11-29 23:33:15,526 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-29 23:33:15,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 23:33:15,567 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-11-29 23:33:15,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 23:33:15,588 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-11-29 23:33:15,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 23:33:15,613 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2020-11-29 23:33:15,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 23:33:15,635 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-11-29 23:33:15,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 23:33:15,648 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-29 23:33:15,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 23:33:15,650 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-11-29 23:33:15,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 23:33:15,664 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2020-11-29 23:33:15,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 23:33:15,667 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2020-11-29 23:33:15,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 23:33:15,688 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2020-11-29 23:33:15,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 23:33:15,745 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-11-29 23:33:15,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 23:33:15,747 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2020-11-29 23:33:15,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 23:33:15,751 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-29 23:33:15,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 23:33:15,753 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-11-29 23:33:15,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 23:33:15,777 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2020-11-29 23:33:15,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 23:33:15,779 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2020-11-29 23:33:15,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 23:33:15,781 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2020-11-29 23:33:15,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 23:33:15,815 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-29 23:33:15,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 23:33:15,818 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-11-29 23:33:15,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 23:33:15,819 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2020-11-29 23:33:15,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 23:33:15,860 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2020-11-29 23:33:15,861 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [588587552] [2020-11-29 23:33:15,861 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-29 23:33:15,861 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2020-11-29 23:33:15,861 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1466164131] [2020-11-29 23:33:15,862 INFO L461 AbstractCegarLoop]: Interpolant automaton has 15 states [2020-11-29 23:33:15,862 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 23:33:15,862 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2020-11-29 23:33:15,862 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=153, Unknown=0, NotChecked=0, Total=210 [2020-11-29 23:33:15,862 INFO L87 Difference]: Start difference. First operand 398 states and 514 transitions. Second operand 15 states. [2020-11-29 23:33:16,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 23:33:16,776 INFO L93 Difference]: Finished difference Result 419 states and 542 transitions. [2020-11-29 23:33:16,776 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-11-29 23:33:16,777 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 165 [2020-11-29 23:33:16,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 23:33:16,779 INFO L225 Difference]: With dead ends: 419 [2020-11-29 23:33:16,779 INFO L226 Difference]: Without dead ends: 419 [2020-11-29 23:33:16,780 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=85, Invalid=257, Unknown=0, NotChecked=0, Total=342 [2020-11-29 23:33:16,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 419 states. [2020-11-29 23:33:16,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 419 to 400. [2020-11-29 23:33:16,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 400 states. [2020-11-29 23:33:16,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 400 states to 400 states and 516 transitions. [2020-11-29 23:33:16,792 INFO L78 Accepts]: Start accepts. Automaton has 400 states and 516 transitions. Word has length 165 [2020-11-29 23:33:16,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 23:33:16,793 INFO L481 AbstractCegarLoop]: Abstraction has 400 states and 516 transitions. [2020-11-29 23:33:16,793 INFO L482 AbstractCegarLoop]: Interpolant automaton has 15 states. [2020-11-29 23:33:16,793 INFO L276 IsEmpty]: Start isEmpty. Operand 400 states and 516 transitions. [2020-11-29 23:33:16,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2020-11-29 23:33:16,795 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 23:33:16,796 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-29 23:33:16,796 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable48 [2020-11-29 23:33:16,796 INFO L429 AbstractCegarLoop]: === Iteration 50 === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr0ENSURES_VIOLATIONMEMORY_LEAK]=== [2020-11-29 23:33:16,796 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 23:33:16,797 INFO L82 PathProgramCache]: Analyzing trace with hash 935313205, now seen corresponding path program 1 times [2020-11-29 23:33:16,797 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 23:33:16,797 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [826432377] [2020-11-29 23:33:16,797 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 23:33:16,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 23:33:16,924 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-29 23:33:16,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 23:33:16,965 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-11-29 23:33:16,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 23:33:16,984 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-11-29 23:33:16,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 23:33:17,004 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2020-11-29 23:33:17,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 23:33:17,024 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-11-29 23:33:17,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 23:33:17,039 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-29 23:33:17,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 23:33:17,041 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-11-29 23:33:17,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 23:33:17,053 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2020-11-29 23:33:17,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 23:33:17,056 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2020-11-29 23:33:17,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 23:33:17,079 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2020-11-29 23:33:17,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 23:33:17,156 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-11-29 23:33:17,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 23:33:17,158 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2020-11-29 23:33:17,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 23:33:17,162 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-29 23:33:17,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 23:33:17,167 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-11-29 23:33:17,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 23:33:17,169 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2020-11-29 23:33:17,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 23:33:17,171 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2020-11-29 23:33:17,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 23:33:17,174 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2020-11-29 23:33:17,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 23:33:17,211 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-29 23:33:17,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 23:33:17,213 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-11-29 23:33:17,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 23:33:17,214 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2020-11-29 23:33:17,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 23:33:17,216 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2020-11-29 23:33:17,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 23:33:17,281 INFO L134 CoverageAnalysis]: Checked inductivity of 97 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 85 trivial. 0 not checked. [2020-11-29 23:33:17,282 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [826432377] [2020-11-29 23:33:17,282 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-29 23:33:17,282 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2020-11-29 23:33:17,282 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [856676770] [2020-11-29 23:33:17,282 INFO L461 AbstractCegarLoop]: Interpolant automaton has 15 states [2020-11-29 23:33:17,282 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 23:33:17,283 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2020-11-29 23:33:17,283 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=153, Unknown=0, NotChecked=0, Total=210 [2020-11-29 23:33:17,283 INFO L87 Difference]: Start difference. First operand 400 states and 516 transitions. Second operand 15 states. [2020-11-29 23:33:17,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 23:33:17,948 INFO L93 Difference]: Finished difference Result 465 states and 613 transitions. [2020-11-29 23:33:17,948 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-11-29 23:33:17,948 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 173 [2020-11-29 23:33:17,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 23:33:17,951 INFO L225 Difference]: With dead ends: 465 [2020-11-29 23:33:17,951 INFO L226 Difference]: Without dead ends: 465 [2020-11-29 23:33:17,952 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=85, Invalid=257, Unknown=0, NotChecked=0, Total=342 [2020-11-29 23:33:17,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 465 states. [2020-11-29 23:33:17,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 465 to 382. [2020-11-29 23:33:17,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 382 states. [2020-11-29 23:33:17,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 382 states to 382 states and 484 transitions. [2020-11-29 23:33:17,964 INFO L78 Accepts]: Start accepts. Automaton has 382 states and 484 transitions. Word has length 173 [2020-11-29 23:33:17,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 23:33:17,964 INFO L481 AbstractCegarLoop]: Abstraction has 382 states and 484 transitions. [2020-11-29 23:33:17,964 INFO L482 AbstractCegarLoop]: Interpolant automaton has 15 states. [2020-11-29 23:33:17,964 INFO L276 IsEmpty]: Start isEmpty. Operand 382 states and 484 transitions. [2020-11-29 23:33:17,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 206 [2020-11-29 23:33:17,967 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 23:33:17,968 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-29 23:33:17,968 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable49 [2020-11-29 23:33:17,968 INFO L429 AbstractCegarLoop]: === Iteration 51 === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr0ENSURES_VIOLATIONMEMORY_LEAK]=== [2020-11-29 23:33:17,968 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 23:33:17,969 INFO L82 PathProgramCache]: Analyzing trace with hash 344976955, now seen corresponding path program 1 times [2020-11-29 23:33:17,969 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 23:33:17,969 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [377593636] [2020-11-29 23:33:17,969 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 23:33:17,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 23:33:18,112 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-29 23:33:18,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 23:33:18,149 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-11-29 23:33:18,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 23:33:18,169 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-11-29 23:33:18,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 23:33:18,188 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2020-11-29 23:33:18,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 23:33:18,213 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-11-29 23:33:18,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 23:33:18,234 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-29 23:33:18,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 23:33:18,236 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-11-29 23:33:18,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 23:33:18,252 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2020-11-29 23:33:18,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 23:33:18,254 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2020-11-29 23:33:18,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 23:33:18,290 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2020-11-29 23:33:18,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 23:33:18,376 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-11-29 23:33:18,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 23:33:18,378 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2020-11-29 23:33:18,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 23:33:18,382 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-29 23:33:18,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 23:33:18,386 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-11-29 23:33:18,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 23:33:18,388 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2020-11-29 23:33:18,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 23:33:18,390 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2020-11-29 23:33:18,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 23:33:18,392 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2020-11-29 23:33:18,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 23:33:18,396 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-29 23:33:18,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 23:33:18,399 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-11-29 23:33:18,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 23:33:18,401 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2020-11-29 23:33:18,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 23:33:18,402 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2020-11-29 23:33:18,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 23:33:18,405 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2020-11-29 23:33:18,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 23:33:18,446 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-29 23:33:18,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 23:33:18,448 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-11-29 23:33:18,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 23:33:18,449 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2020-11-29 23:33:18,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 23:33:18,510 INFO L134 CoverageAnalysis]: Checked inductivity of 179 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 161 trivial. 0 not checked. [2020-11-29 23:33:18,510 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [377593636] [2020-11-29 23:33:18,510 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-29 23:33:18,510 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2020-11-29 23:33:18,511 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1556326999] [2020-11-29 23:33:18,511 INFO L461 AbstractCegarLoop]: Interpolant automaton has 15 states [2020-11-29 23:33:18,511 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 23:33:18,511 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2020-11-29 23:33:18,514 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=153, Unknown=0, NotChecked=0, Total=210 [2020-11-29 23:33:18,514 INFO L87 Difference]: Start difference. First operand 382 states and 484 transitions. Second operand 15 states. [2020-11-29 23:33:19,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 23:33:19,064 INFO L93 Difference]: Finished difference Result 389 states and 490 transitions. [2020-11-29 23:33:19,065 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-11-29 23:33:19,065 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 205 [2020-11-29 23:33:19,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 23:33:19,067 INFO L225 Difference]: With dead ends: 389 [2020-11-29 23:33:19,067 INFO L226 Difference]: Without dead ends: 389 [2020-11-29 23:33:19,067 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=85, Invalid=257, Unknown=0, NotChecked=0, Total=342 [2020-11-29 23:33:19,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 389 states. [2020-11-29 23:33:19,077 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 389 to 382. [2020-11-29 23:33:19,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 382 states. [2020-11-29 23:33:19,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 382 states to 382 states and 482 transitions. [2020-11-29 23:33:19,079 INFO L78 Accepts]: Start accepts. Automaton has 382 states and 482 transitions. Word has length 205 [2020-11-29 23:33:19,080 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 23:33:19,080 INFO L481 AbstractCegarLoop]: Abstraction has 382 states and 482 transitions. [2020-11-29 23:33:19,080 INFO L482 AbstractCegarLoop]: Interpolant automaton has 15 states. [2020-11-29 23:33:19,080 INFO L276 IsEmpty]: Start isEmpty. Operand 382 states and 482 transitions. [2020-11-29 23:33:19,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2020-11-29 23:33:19,084 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 23:33:19,085 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-29 23:33:19,085 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50 [2020-11-29 23:33:19,085 INFO L429 AbstractCegarLoop]: === Iteration 52 === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr0ENSURES_VIOLATIONMEMORY_LEAK]=== [2020-11-29 23:33:19,085 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 23:33:19,086 INFO L82 PathProgramCache]: Analyzing trace with hash 772210720, now seen corresponding path program 1 times [2020-11-29 23:33:19,086 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 23:33:19,086 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [125087806] [2020-11-29 23:33:19,086 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 23:33:19,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 23:33:19,260 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-29 23:33:19,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 23:33:19,304 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-11-29 23:33:19,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 23:33:19,327 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-11-29 23:33:19,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 23:33:19,350 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2020-11-29 23:33:19,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 23:33:19,372 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-11-29 23:33:19,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 23:33:19,384 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-29 23:33:19,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 23:33:19,386 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-11-29 23:33:19,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 23:33:19,396 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2020-11-29 23:33:19,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 23:33:19,398 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2020-11-29 23:33:19,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 23:33:19,425 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2020-11-29 23:33:19,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 23:33:19,504 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-11-29 23:33:19,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 23:33:19,505 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2020-11-29 23:33:19,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 23:33:19,509 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-29 23:33:19,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 23:33:19,511 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-11-29 23:33:19,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 23:33:19,513 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2020-11-29 23:33:19,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 23:33:19,515 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2020-11-29 23:33:19,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 23:33:19,517 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2020-11-29 23:33:19,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 23:33:19,521 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-29 23:33:19,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 23:33:19,523 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-11-29 23:33:19,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 23:33:19,525 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2020-11-29 23:33:19,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 23:33:19,527 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2020-11-29 23:33:19,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 23:33:19,529 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2020-11-29 23:33:19,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 23:33:19,584 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-29 23:33:19,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 23:33:19,586 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-11-29 23:33:19,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 23:33:19,587 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2020-11-29 23:33:19,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 23:33:19,654 INFO L134 CoverageAnalysis]: Checked inductivity of 179 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 161 trivial. 0 not checked. [2020-11-29 23:33:19,655 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [125087806] [2020-11-29 23:33:19,655 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-29 23:33:19,655 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2020-11-29 23:33:19,655 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [220241859] [2020-11-29 23:33:19,656 INFO L461 AbstractCegarLoop]: Interpolant automaton has 15 states [2020-11-29 23:33:19,656 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 23:33:19,656 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2020-11-29 23:33:19,656 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=153, Unknown=0, NotChecked=0, Total=210 [2020-11-29 23:33:19,657 INFO L87 Difference]: Start difference. First operand 382 states and 482 transitions. Second operand 15 states. [2020-11-29 23:33:20,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 23:33:20,447 INFO L93 Difference]: Finished difference Result 368 states and 458 transitions. [2020-11-29 23:33:20,447 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-11-29 23:33:20,448 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 208 [2020-11-29 23:33:20,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 23:33:20,450 INFO L225 Difference]: With dead ends: 368 [2020-11-29 23:33:20,450 INFO L226 Difference]: Without dead ends: 333 [2020-11-29 23:33:20,450 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=85, Invalid=257, Unknown=0, NotChecked=0, Total=342 [2020-11-29 23:33:20,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 333 states. [2020-11-29 23:33:20,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 333 to 332. [2020-11-29 23:33:20,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 332 states. [2020-11-29 23:33:20,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 332 states to 332 states and 391 transitions. [2020-11-29 23:33:20,459 INFO L78 Accepts]: Start accepts. Automaton has 332 states and 391 transitions. Word has length 208 [2020-11-29 23:33:20,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 23:33:20,459 INFO L481 AbstractCegarLoop]: Abstraction has 332 states and 391 transitions. [2020-11-29 23:33:20,459 INFO L482 AbstractCegarLoop]: Interpolant automaton has 15 states. [2020-11-29 23:33:20,459 INFO L276 IsEmpty]: Start isEmpty. Operand 332 states and 391 transitions. [2020-11-29 23:33:20,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 214 [2020-11-29 23:33:20,462 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 23:33:20,463 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-29 23:33:20,463 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable51 [2020-11-29 23:33:20,463 INFO L429 AbstractCegarLoop]: === Iteration 53 === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr0ENSURES_VIOLATIONMEMORY_LEAK]=== [2020-11-29 23:33:20,463 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 23:33:20,464 INFO L82 PathProgramCache]: Analyzing trace with hash -392021476, now seen corresponding path program 1 times [2020-11-29 23:33:20,464 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 23:33:20,464 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1782840710] [2020-11-29 23:33:20,464 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 23:33:20,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 23:33:20,627 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-29 23:33:20,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 23:33:20,659 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-11-29 23:33:20,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 23:33:20,676 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-11-29 23:33:20,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 23:33:20,691 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2020-11-29 23:33:20,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 23:33:20,741 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-11-29 23:33:20,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 23:33:20,763 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-29 23:33:20,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 23:33:20,765 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-11-29 23:33:20,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 23:33:20,777 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2020-11-29 23:33:20,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 23:33:20,780 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2020-11-29 23:33:20,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 23:33:20,795 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2020-11-29 23:33:20,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 23:33:20,897 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-11-29 23:33:20,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 23:33:20,899 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2020-11-29 23:33:20,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 23:33:20,903 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-29 23:33:20,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 23:33:20,907 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-11-29 23:33:20,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 23:33:20,909 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2020-11-29 23:33:20,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 23:33:20,910 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2020-11-29 23:33:20,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 23:33:20,912 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2020-11-29 23:33:20,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 23:33:20,916 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-29 23:33:20,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 23:33:20,918 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-11-29 23:33:20,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 23:33:20,919 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2020-11-29 23:33:20,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 23:33:20,921 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2020-11-29 23:33:20,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 23:33:20,923 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2020-11-29 23:33:20,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 23:33:20,963 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-29 23:33:20,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 23:33:20,965 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-11-29 23:33:20,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 23:33:20,967 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2020-11-29 23:33:20,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 23:33:20,969 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2020-11-29 23:33:20,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 23:33:21,039 INFO L134 CoverageAnalysis]: Checked inductivity of 194 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 176 trivial. 0 not checked. [2020-11-29 23:33:21,039 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1782840710] [2020-11-29 23:33:21,039 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-29 23:33:21,039 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2020-11-29 23:33:21,040 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1527207411] [2020-11-29 23:33:21,040 INFO L461 AbstractCegarLoop]: Interpolant automaton has 15 states [2020-11-29 23:33:21,040 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 23:33:21,041 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2020-11-29 23:33:21,041 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=153, Unknown=0, NotChecked=0, Total=210 [2020-11-29 23:33:21,041 INFO L87 Difference]: Start difference. First operand 332 states and 391 transitions. Second operand 15 states. [2020-11-29 23:33:21,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 23:33:21,547 INFO L93 Difference]: Finished difference Result 287 states and 339 transitions. [2020-11-29 23:33:21,547 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-11-29 23:33:21,547 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 213 [2020-11-29 23:33:21,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 23:33:21,548 INFO L225 Difference]: With dead ends: 287 [2020-11-29 23:33:21,548 INFO L226 Difference]: Without dead ends: 0 [2020-11-29 23:33:21,548 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=85, Invalid=257, Unknown=0, NotChecked=0, Total=342 [2020-11-29 23:33:21,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-11-29 23:33:21,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-11-29 23:33:21,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-11-29 23:33:21,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-11-29 23:33:21,549 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 213 [2020-11-29 23:33:21,549 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 23:33:21,549 INFO L481 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-11-29 23:33:21,549 INFO L482 AbstractCegarLoop]: Interpolant automaton has 15 states. [2020-11-29 23:33:21,549 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-11-29 23:33:21,549 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-11-29 23:33:21,549 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable52 [2020-11-29 23:33:21,554 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 29.11 11:33:21 BoogieIcfgContainer [2020-11-29 23:33:21,554 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-11-29 23:33:21,554 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-11-29 23:33:21,554 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-11-29 23:33:21,554 INFO L275 PluginConnector]: Witness Printer initialized [2020-11-29 23:33:21,555 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 11:31:43" (3/4) ... [2020-11-29 23:33:21,558 INFO L137 WitnessPrinter]: Generating witness for correct program [2020-11-29 23:33:21,566 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure reach_error [2020-11-29 23:33:21,567 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure _BLAST_init [2020-11-29 23:33:21,567 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2020-11-29 23:33:21,567 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure DiskPerfSyncFilterWithTarget [2020-11-29 23:33:21,567 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure stubMoreProcessingRequired [2020-11-29 23:33:21,567 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure PoCallDriver [2020-11-29 23:33:21,567 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure DiskPerfDispatchPower [2020-11-29 23:33:21,567 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure KeWaitForSingleObject [2020-11-29 23:33:21,568 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure IofCompleteRequest [2020-11-29 23:33:21,568 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure IoBuildDeviceIoControlRequest [2020-11-29 23:33:21,568 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure KeSetEvent [2020-11-29 23:33:21,568 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure stub_driver_init [2020-11-29 23:33:21,568 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure DiskPerfSendToNextDriver [2020-11-29 23:33:21,568 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure DiskPerfStartDevice [2020-11-29 23:33:21,568 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure DiskPerfForwardIrpSynchronous [2020-11-29 23:33:21,568 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure DiskPerfRegisterDevice [2020-11-29 23:33:21,569 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure DiskPerfDeviceControl [2020-11-29 23:33:21,569 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure errorFn [2020-11-29 23:33:21,569 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure DiskPerfRemoveDevice [2020-11-29 23:33:21,569 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure DiskPerfCreate [2020-11-29 23:33:21,569 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure DiskPerfUnload [2020-11-29 23:33:21,569 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure DiskPerfIrpCompletion [2020-11-29 23:33:21,569 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure IofCallDriver [2020-11-29 23:33:21,569 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure DiskPerfIoCompletion [2020-11-29 23:33:21,570 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure DiskPerfDispatchPnp [2020-11-29 23:33:21,570 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2020-11-29 23:33:21,570 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure DiskPerfShutdownFlush [2020-11-29 23:33:21,590 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 64 nodes and edges [2020-11-29 23:33:21,592 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 37 nodes and edges [2020-11-29 23:33:21,594 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2020-11-29 23:33:21,598 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2020-11-29 23:33:21,772 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_27253434-b648-4f77-a9cd-bcc7a4e89299/bin/uautomizer/witness.graphml [2020-11-29 23:33:21,772 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-11-29 23:33:21,774 INFO L168 Benchmark]: Toolchain (without parser) took 100760.71 ms. Allocated memory was 77.6 MB in the beginning and 685.8 MB in the end (delta: 608.2 MB). Free memory was 43.8 MB in the beginning and 353.3 MB in the end (delta: -309.4 MB). Peak memory consumption was 299.7 MB. Max. memory is 16.1 GB. [2020-11-29 23:33:21,774 INFO L168 Benchmark]: CDTParser took 0.71 ms. Allocated memory is still 77.6 MB. Free memory was 51.0 MB in the beginning and 51.0 MB in the end (delta: 27.4 kB). There was no memory consumed. Max. memory is 16.1 GB. [2020-11-29 23:33:21,775 INFO L168 Benchmark]: CACSL2BoogieTranslator took 666.41 ms. Allocated memory was 77.6 MB in the beginning and 102.8 MB in the end (delta: 25.2 MB). Free memory was 43.7 MB in the beginning and 69.8 MB in the end (delta: -26.2 MB). Peak memory consumption was 3.7 MB. Max. memory is 16.1 GB. [2020-11-29 23:33:21,775 INFO L168 Benchmark]: Boogie Preprocessor took 123.20 ms. Allocated memory is still 102.8 MB. Free memory was 69.8 MB in the beginning and 66.3 MB in the end (delta: 3.6 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. [2020-11-29 23:33:21,775 INFO L168 Benchmark]: RCFGBuilder took 1608.15 ms. Allocated memory is still 102.8 MB. Free memory was 66.3 MB in the beginning and 75.3 MB in the end (delta: -9.0 MB). Peak memory consumption was 25.5 MB. Max. memory is 16.1 GB. [2020-11-29 23:33:21,776 INFO L168 Benchmark]: TraceAbstraction took 98136.58 ms. Allocated memory was 102.8 MB in the beginning and 685.8 MB in the end (delta: 583.0 MB). Free memory was 74.7 MB in the beginning and 373.2 MB in the end (delta: -298.5 MB). Peak memory consumption was 284.2 MB. Max. memory is 16.1 GB. [2020-11-29 23:33:21,776 INFO L168 Benchmark]: Witness Printer took 218.39 ms. Allocated memory is still 685.8 MB. Free memory was 373.2 MB in the beginning and 353.3 MB in the end (delta: 19.9 MB). Peak memory consumption was 21.0 MB. Max. memory is 16.1 GB. [2020-11-29 23:33:21,779 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.71 ms. Allocated memory is still 77.6 MB. Free memory was 51.0 MB in the beginning and 51.0 MB in the end (delta: 27.4 kB). There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 666.41 ms. Allocated memory was 77.6 MB in the beginning and 102.8 MB in the end (delta: 25.2 MB). Free memory was 43.7 MB in the beginning and 69.8 MB in the end (delta: -26.2 MB). Peak memory consumption was 3.7 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 123.20 ms. Allocated memory is still 102.8 MB. Free memory was 69.8 MB in the beginning and 66.3 MB in the end (delta: 3.6 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. * RCFGBuilder took 1608.15 ms. Allocated memory is still 102.8 MB. Free memory was 66.3 MB in the beginning and 75.3 MB in the end (delta: -9.0 MB). Peak memory consumption was 25.5 MB. Max. memory is 16.1 GB. * TraceAbstraction took 98136.58 ms. Allocated memory was 102.8 MB in the beginning and 685.8 MB in the end (delta: 583.0 MB). Free memory was 74.7 MB in the beginning and 373.2 MB in the end (delta: -298.5 MB). Peak memory consumption was 284.2 MB. Max. memory is 16.1 GB. * Witness Printer took 218.39 ms. Allocated memory is still 685.8 MB. Free memory was 373.2 MB in the beginning and 353.3 MB in the end (delta: 19.9 MB). Peak memory consumption was 21.0 MB. Max. memory is 16.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 3]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - PositiveResult [Line: 647]: 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, 300 locations, 2 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 98.0s, OverallIterations: 53, TraceHistogramMax: 4, AutomataDifference: 73.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 14525 SDtfs, 14727 SDslu, 45006 SDs, 0 SdLazy, 60260 SolverSat, 6938 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 52.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1843 GetRequests, 986 SyntacticMatches, 4 SemanticMatches, 853 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2929 ImplicationChecksByTransitivity, 24.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1086occurred in iteration=8, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.2s AutomataMinimizationTime, 53 MinimizatonAttempts, 2810 StatesRemovedByMinimization, 50 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 1.0s SatisfiabilityAnalysisTime, 20.4s InterpolantComputationTime, 4393 NumberOfCodeBlocks, 4393 NumberOfCodeBlocksAsserted, 54 NumberOfCheckSat, 4339 ConstructedInterpolants, 0 QuantifiedInterpolants, 1647640 SizeOfPredicates, 2 NumberOfNonLiveVariables, 1362 ConjunctsInSsa, 5 ConjunctsInUnsatCore, 54 InterpolantComputations, 53 PerfectInterpolantSequences, 1045/1051 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...