./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/ntdrivers-simplified/kbfiltr_simpl2.cil-1.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 30f4e4ab Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/ntdrivers-simplified/kbfiltr_simpl2.cil-1.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash e4d1760c3f63950e961525df0d726cb05fa47146 .......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-30f4e4a [2019-11-28 02:46:00,024 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-28 02:46:00,027 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-28 02:46:00,047 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-28 02:46:00,048 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-28 02:46:00,050 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-28 02:46:00,053 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-28 02:46:00,066 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-28 02:46:00,068 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-28 02:46:00,071 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-28 02:46:00,072 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-28 02:46:00,073 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-28 02:46:00,073 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-28 02:46:00,074 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-28 02:46:00,075 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-28 02:46:00,077 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-28 02:46:00,078 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-28 02:46:00,079 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-28 02:46:00,081 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-28 02:46:00,083 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-28 02:46:00,085 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-28 02:46:00,087 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-28 02:46:00,088 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-28 02:46:00,089 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-28 02:46:00,091 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-28 02:46:00,092 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-28 02:46:00,092 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-28 02:46:00,093 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-28 02:46:00,094 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-28 02:46:00,095 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-28 02:46:00,095 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-28 02:46:00,096 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-28 02:46:00,097 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-28 02:46:00,098 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-28 02:46:00,100 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-28 02:46:00,100 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-28 02:46:00,101 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-28 02:46:00,101 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-28 02:46:00,101 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-28 02:46:00,103 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-28 02:46:00,104 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-28 02:46:00,105 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2019-11-28 02:46:00,120 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-28 02:46:00,120 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-28 02:46:00,122 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-28 02:46:00,122 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-28 02:46:00,122 INFO L138 SettingsManager]: * Use SBE=true [2019-11-28 02:46:00,123 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-28 02:46:00,123 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-28 02:46:00,123 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-28 02:46:00,123 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-28 02:46:00,124 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-28 02:46:00,124 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-28 02:46:00,124 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2019-11-28 02:46:00,124 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2019-11-28 02:46:00,125 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2019-11-28 02:46:00,125 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-28 02:46:00,125 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2019-11-28 02:46:00,126 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-28 02:46:00,126 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-28 02:46:00,126 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-28 02:46:00,127 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-28 02:46:00,127 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-28 02:46:00,127 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-28 02:46:00,127 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-28 02:46:00,128 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-28 02:46:00,128 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-28 02:46:00,128 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-28 02:46:00,129 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-28 02:46:00,129 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> e4d1760c3f63950e961525df0d726cb05fa47146 [2019-11-28 02:46:00,454 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-28 02:46:00,468 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-28 02:46:00,472 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-28 02:46:00,474 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-28 02:46:00,475 INFO L275 PluginConnector]: CDTParser initialized [2019-11-28 02:46:00,476 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ntdrivers-simplified/kbfiltr_simpl2.cil-1.c [2019-11-28 02:46:00,546 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/506c67f4d/14f6bcec2c2541ca863d6bea64fafabb/FLAG6df4765a9 [2019-11-28 02:46:01,085 INFO L306 CDTParser]: Found 1 translation units. [2019-11-28 02:46:01,086 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ntdrivers-simplified/kbfiltr_simpl2.cil-1.c [2019-11-28 02:46:01,111 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/506c67f4d/14f6bcec2c2541ca863d6bea64fafabb/FLAG6df4765a9 [2019-11-28 02:46:01,424 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/506c67f4d/14f6bcec2c2541ca863d6bea64fafabb [2019-11-28 02:46:01,428 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-28 02:46:01,430 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-11-28 02:46:01,434 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-28 02:46:01,435 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-28 02:46:01,439 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-28 02:46:01,440 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 02:46:01" (1/1) ... [2019-11-28 02:46:01,444 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@25640e1b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:46:01, skipping insertion in model container [2019-11-28 02:46:01,445 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 02:46:01" (1/1) ... [2019-11-28 02:46:01,454 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-28 02:46:01,528 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-28 02:46:01,926 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 02:46:01,932 INFO L203 MainTranslator]: Completed pre-run [2019-11-28 02:46:02,021 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 02:46:02,043 INFO L208 MainTranslator]: Completed translation [2019-11-28 02:46:02,044 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:46:02 WrapperNode [2019-11-28 02:46:02,044 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-28 02:46:02,045 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-28 02:46:02,045 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-28 02:46:02,045 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-28 02:46:02,061 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:46:02" (1/1) ... [2019-11-28 02:46:02,062 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:46:02" (1/1) ... [2019-11-28 02:46:02,088 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:46:02" (1/1) ... [2019-11-28 02:46:02,088 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:46:02" (1/1) ... [2019-11-28 02:46:02,123 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:46:02" (1/1) ... [2019-11-28 02:46:02,144 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:46:02" (1/1) ... [2019-11-28 02:46:02,148 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:46:02" (1/1) ... [2019-11-28 02:46:02,158 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-28 02:46:02,160 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-28 02:46:02,160 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-28 02:46:02,166 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-28 02:46:02,168 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:46:02" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 [2019-11-28 02:46:02,221 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-11-28 02:46:02,221 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-28 02:46:02,221 INFO L138 BoogieDeclarations]: Found implementation of procedure stub_driver_init [2019-11-28 02:46:02,221 INFO L138 BoogieDeclarations]: Found implementation of procedure _BLAST_init [2019-11-28 02:46:02,222 INFO L138 BoogieDeclarations]: Found implementation of procedure KbFilter_PnP [2019-11-28 02:46:02,223 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-11-28 02:46:02,224 INFO L138 BoogieDeclarations]: Found implementation of procedure stubMoreProcessingRequired [2019-11-28 02:46:02,225 INFO L138 BoogieDeclarations]: Found implementation of procedure IofCallDriver [2019-11-28 02:46:02,225 INFO L138 BoogieDeclarations]: Found implementation of procedure IofCompleteRequest [2019-11-28 02:46:02,225 INFO L138 BoogieDeclarations]: Found implementation of procedure KeSetEvent [2019-11-28 02:46:02,225 INFO L138 BoogieDeclarations]: Found implementation of procedure KeWaitForSingleObject [2019-11-28 02:46:02,226 INFO L138 BoogieDeclarations]: Found implementation of procedure KbFilter_Complete [2019-11-28 02:46:02,227 INFO L138 BoogieDeclarations]: Found implementation of procedure KbFilter_CreateClose [2019-11-28 02:46:02,227 INFO L138 BoogieDeclarations]: Found implementation of procedure KbFilter_DispatchPassThrough [2019-11-28 02:46:02,227 INFO L138 BoogieDeclarations]: Found implementation of procedure KbFilter_Power [2019-11-28 02:46:02,227 INFO L138 BoogieDeclarations]: Found implementation of procedure PoCallDriver [2019-11-28 02:46:02,227 INFO L138 BoogieDeclarations]: Found implementation of procedure KbFilter_InternIoCtl [2019-11-28 02:46:02,230 INFO L138 BoogieDeclarations]: Found implementation of procedure errorFn [2019-11-28 02:46:02,230 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-11-28 02:46:02,231 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-11-28 02:46:02,231 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-11-28 02:46:02,231 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_long [2019-11-28 02:46:02,231 INFO L130 BoogieDeclarations]: Found specification of procedure PoCallDriver [2019-11-28 02:46:02,232 INFO L130 BoogieDeclarations]: Found specification of procedure KbFilter_PnP [2019-11-28 02:46:02,232 INFO L130 BoogieDeclarations]: Found specification of procedure IofCallDriver [2019-11-28 02:46:02,232 INFO L130 BoogieDeclarations]: Found specification of procedure KeSetEvent [2019-11-28 02:46:02,232 INFO L130 BoogieDeclarations]: Found specification of procedure KeWaitForSingleObject [2019-11-28 02:46:02,233 INFO L130 BoogieDeclarations]: Found specification of procedure KbFilter_Complete [2019-11-28 02:46:02,233 INFO L130 BoogieDeclarations]: Found specification of procedure KbFilter_CreateClose [2019-11-28 02:46:02,233 INFO L130 BoogieDeclarations]: Found specification of procedure KbFilter_DispatchPassThrough [2019-11-28 02:46:02,234 INFO L130 BoogieDeclarations]: Found specification of procedure KbFilter_Power [2019-11-28 02:46:02,234 INFO L130 BoogieDeclarations]: Found specification of procedure KbFilter_InternIoCtl [2019-11-28 02:46:02,234 INFO L130 BoogieDeclarations]: Found specification of procedure stub_driver_init [2019-11-28 02:46:02,234 INFO L130 BoogieDeclarations]: Found specification of procedure _BLAST_init [2019-11-28 02:46:02,235 INFO L130 BoogieDeclarations]: Found specification of procedure IofCompleteRequest [2019-11-28 02:46:02,235 INFO L130 BoogieDeclarations]: Found specification of procedure errorFn [2019-11-28 02:46:02,235 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-11-28 02:46:02,235 INFO L130 BoogieDeclarations]: Found specification of procedure stubMoreProcessingRequired [2019-11-28 02:46:02,236 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-11-28 02:46:02,236 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-28 02:46:02,562 WARN L759 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-28 02:46:02,639 INFO L712 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##10: assume !false; [2019-11-28 02:46:02,640 INFO L712 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##9: assume false; [2019-11-28 02:46:02,659 WARN L759 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-28 02:46:02,779 INFO L712 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##18: assume false; [2019-11-28 02:46:02,779 INFO L712 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##19: assume !false; [2019-11-28 02:46:02,780 WARN L759 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-28 02:46:02,825 INFO L712 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##12: assume !false; [2019-11-28 02:46:02,825 INFO L712 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##11: assume false; [2019-11-28 02:46:02,831 WARN L759 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-28 02:46:02,885 INFO L712 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##12: assume !false; [2019-11-28 02:46:02,885 INFO L712 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##11: assume false; [2019-11-28 02:46:02,997 WARN L759 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-28 02:46:03,028 INFO L712 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##16: assume !false; [2019-11-28 02:46:03,028 INFO L712 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##15: assume false; [2019-11-28 02:46:03,052 WARN L759 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-28 02:46:03,157 INFO L712 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##43: assume false; [2019-11-28 02:46:03,157 INFO L712 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##44: assume !false; [2019-11-28 02:46:03,169 INFO L292 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-28 02:46:03,169 INFO L297 CfgBuilder]: Removed 0 assume(true) statements. [2019-11-28 02:46:03,171 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 02:46:03 BoogieIcfgContainer [2019-11-28 02:46:03,171 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-28 02:46:03,172 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-28 02:46:03,172 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-28 02:46:03,176 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-28 02:46:03,176 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 02:46:01" (1/3) ... [2019-11-28 02:46:03,177 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1cb471 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 02:46:03, skipping insertion in model container [2019-11-28 02:46:03,177 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:46:02" (2/3) ... [2019-11-28 02:46:03,178 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1cb471 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 02:46:03, skipping insertion in model container [2019-11-28 02:46:03,178 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 02:46:03" (3/3) ... [2019-11-28 02:46:03,180 INFO L109 eAbstractionObserver]: Analyzing ICFG kbfiltr_simpl2.cil-1.c [2019-11-28 02:46:03,191 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-28 02:46:03,199 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-28 02:46:03,212 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-28 02:46:03,233 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-28 02:46:03,233 INFO L374 AbstractCegarLoop]: Hoare is false [2019-11-28 02:46:03,233 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-28 02:46:03,234 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-28 02:46:03,234 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-28 02:46:03,234 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-28 02:46:03,234 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-28 02:46:03,234 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-28 02:46:03,261 INFO L276 IsEmpty]: Start isEmpty. Operand 239 states. [2019-11-28 02:46:03,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-11-28 02:46:03,276 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 02:46:03,278 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 02:46:03,278 INFO L410 AbstractCegarLoop]: === Iteration 1 === [errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK]=== [2019-11-28 02:46:03,285 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:46:03,285 INFO L82 PathProgramCache]: Analyzing trace with hash 1712773315, now seen corresponding path program 1 times [2019-11-28 02:46:03,293 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:46:03,293 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2070451953] [2019-11-28 02:46:03,293 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:46:03,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:46:03,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:46:03,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:46:03,818 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 02:46:03,819 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2070451953] [2019-11-28 02:46:03,820 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 02:46:03,821 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-28 02:46:03,823 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1775902698] [2019-11-28 02:46:03,830 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-28 02:46:03,830 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:46:03,848 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-28 02:46:03,849 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-28 02:46:03,852 INFO L87 Difference]: Start difference. First operand 239 states. Second operand 5 states. [2019-11-28 02:46:04,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:46:04,947 INFO L93 Difference]: Finished difference Result 268 states and 385 transitions. [2019-11-28 02:46:04,949 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-28 02:46:04,950 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 20 [2019-11-28 02:46:04,951 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 02:46:04,967 INFO L225 Difference]: With dead ends: 268 [2019-11-28 02:46:04,967 INFO L226 Difference]: Without dead ends: 256 [2019-11-28 02:46:04,969 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-28 02:46:04,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 256 states. [2019-11-28 02:46:05,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 256 to 228. [2019-11-28 02:46:05,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 228 states. [2019-11-28 02:46:05,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 228 states to 228 states and 322 transitions. [2019-11-28 02:46:05,036 INFO L78 Accepts]: Start accepts. Automaton has 228 states and 322 transitions. Word has length 20 [2019-11-28 02:46:05,037 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 02:46:05,037 INFO L462 AbstractCegarLoop]: Abstraction has 228 states and 322 transitions. [2019-11-28 02:46:05,037 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-28 02:46:05,037 INFO L276 IsEmpty]: Start isEmpty. Operand 228 states and 322 transitions. [2019-11-28 02:46:05,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-11-28 02:46:05,039 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 02:46:05,039 INFO L410 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] [2019-11-28 02:46:05,039 INFO L410 AbstractCegarLoop]: === Iteration 2 === [errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK]=== [2019-11-28 02:46:05,039 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:46:05,040 INFO L82 PathProgramCache]: Analyzing trace with hash -1840561730, now seen corresponding path program 1 times [2019-11-28 02:46:05,040 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:46:05,040 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1558661371] [2019-11-28 02:46:05,040 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:46:05,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:46:05,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:46:05,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:46:05,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:46:05,402 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 02:46:05,402 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1558661371] [2019-11-28 02:46:05,403 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 02:46:05,403 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-28 02:46:05,403 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2091749809] [2019-11-28 02:46:05,405 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-28 02:46:05,405 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:46:05,405 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-28 02:46:05,406 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-11-28 02:46:05,406 INFO L87 Difference]: Start difference. First operand 228 states and 322 transitions. Second operand 6 states. [2019-11-28 02:46:06,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:46:06,645 INFO L93 Difference]: Finished difference Result 344 states and 470 transitions. [2019-11-28 02:46:06,645 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-28 02:46:06,645 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 28 [2019-11-28 02:46:06,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 02:46:06,649 INFO L225 Difference]: With dead ends: 344 [2019-11-28 02:46:06,650 INFO L226 Difference]: Without dead ends: 343 [2019-11-28 02:46:06,651 INFO L630 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 [2019-11-28 02:46:06,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 343 states. [2019-11-28 02:46:06,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 343 to 301. [2019-11-28 02:46:06,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 301 states. [2019-11-28 02:46:06,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 301 states to 301 states and 411 transitions. [2019-11-28 02:46:06,692 INFO L78 Accepts]: Start accepts. Automaton has 301 states and 411 transitions. Word has length 28 [2019-11-28 02:46:06,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 02:46:06,692 INFO L462 AbstractCegarLoop]: Abstraction has 301 states and 411 transitions. [2019-11-28 02:46:06,693 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-28 02:46:06,693 INFO L276 IsEmpty]: Start isEmpty. Operand 301 states and 411 transitions. [2019-11-28 02:46:06,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-11-28 02:46:06,695 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 02:46:06,695 INFO L410 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] [2019-11-28 02:46:06,696 INFO L410 AbstractCegarLoop]: === Iteration 3 === [errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK]=== [2019-11-28 02:46:06,696 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:46:06,696 INFO L82 PathProgramCache]: Analyzing trace with hash -919522484, now seen corresponding path program 1 times [2019-11-28 02:46:06,697 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:46:06,697 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [837435857] [2019-11-28 02:46:06,697 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:46:06,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:46:06,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:46:06,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:46:06,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:46:06,937 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 02:46:06,937 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [837435857] [2019-11-28 02:46:06,938 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 02:46:06,938 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-28 02:46:06,938 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1717120173] [2019-11-28 02:46:06,940 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-28 02:46:06,940 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:46:06,940 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-28 02:46:06,941 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-11-28 02:46:06,941 INFO L87 Difference]: Start difference. First operand 301 states and 411 transitions. Second operand 6 states. [2019-11-28 02:46:07,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:46:07,774 INFO L93 Difference]: Finished difference Result 362 states and 486 transitions. [2019-11-28 02:46:07,774 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-28 02:46:07,774 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 28 [2019-11-28 02:46:07,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 02:46:07,778 INFO L225 Difference]: With dead ends: 362 [2019-11-28 02:46:07,778 INFO L226 Difference]: Without dead ends: 362 [2019-11-28 02:46:07,778 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-11-28 02:46:07,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 362 states. [2019-11-28 02:46:07,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 362 to 341. [2019-11-28 02:46:07,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 341 states. [2019-11-28 02:46:07,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 341 states to 341 states and 462 transitions. [2019-11-28 02:46:07,805 INFO L78 Accepts]: Start accepts. Automaton has 341 states and 462 transitions. Word has length 28 [2019-11-28 02:46:07,805 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 02:46:07,806 INFO L462 AbstractCegarLoop]: Abstraction has 341 states and 462 transitions. [2019-11-28 02:46:07,806 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-28 02:46:07,806 INFO L276 IsEmpty]: Start isEmpty. Operand 341 states and 462 transitions. [2019-11-28 02:46:07,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-11-28 02:46:07,808 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 02:46:07,808 INFO L410 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] [2019-11-28 02:46:07,809 INFO L410 AbstractCegarLoop]: === Iteration 4 === [errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK]=== [2019-11-28 02:46:07,809 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:46:07,809 INFO L82 PathProgramCache]: Analyzing trace with hash -1823384951, now seen corresponding path program 1 times [2019-11-28 02:46:07,809 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:46:07,810 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [908284573] [2019-11-28 02:46:07,810 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:46:07,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:46:07,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:46:07,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:46:07,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:46:07,993 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 02:46:07,993 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [908284573] [2019-11-28 02:46:07,994 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 02:46:07,994 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-28 02:46:07,994 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [42772423] [2019-11-28 02:46:07,995 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-28 02:46:07,995 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:46:07,996 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-28 02:46:07,996 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-11-28 02:46:07,996 INFO L87 Difference]: Start difference. First operand 341 states and 462 transitions. Second operand 6 states. [2019-11-28 02:46:08,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:46:08,861 INFO L93 Difference]: Finished difference Result 340 states and 459 transitions. [2019-11-28 02:46:08,864 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-28 02:46:08,864 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 38 [2019-11-28 02:46:08,865 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 02:46:08,867 INFO L225 Difference]: With dead ends: 340 [2019-11-28 02:46:08,868 INFO L226 Difference]: Without dead ends: 340 [2019-11-28 02:46:08,868 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-11-28 02:46:08,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 340 states. [2019-11-28 02:46:08,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 340 to 340. [2019-11-28 02:46:08,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 340 states. [2019-11-28 02:46:08,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 340 states to 340 states and 459 transitions. [2019-11-28 02:46:08,886 INFO L78 Accepts]: Start accepts. Automaton has 340 states and 459 transitions. Word has length 38 [2019-11-28 02:46:08,886 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 02:46:08,886 INFO L462 AbstractCegarLoop]: Abstraction has 340 states and 459 transitions. [2019-11-28 02:46:08,886 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-28 02:46:08,887 INFO L276 IsEmpty]: Start isEmpty. Operand 340 states and 459 transitions. [2019-11-28 02:46:08,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-11-28 02:46:08,890 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 02:46:08,891 INFO L410 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] [2019-11-28 02:46:08,891 INFO L410 AbstractCegarLoop]: === Iteration 5 === [errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK]=== [2019-11-28 02:46:08,891 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:46:08,892 INFO L82 PathProgramCache]: Analyzing trace with hash 1946925920, now seen corresponding path program 1 times [2019-11-28 02:46:08,892 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:46:08,892 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [764903230] [2019-11-28 02:46:08,893 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:46:08,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:46:08,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:46:09,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:46:09,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:46:09,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:46:09,093 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 02:46:09,093 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [764903230] [2019-11-28 02:46:09,094 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 02:46:09,094 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-11-28 02:46:09,094 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [874903153] [2019-11-28 02:46:09,095 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-28 02:46:09,095 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:46:09,095 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-28 02:46:09,095 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-11-28 02:46:09,095 INFO L87 Difference]: Start difference. First operand 340 states and 459 transitions. Second operand 8 states. [2019-11-28 02:46:10,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:46:10,235 INFO L93 Difference]: Finished difference Result 319 states and 423 transitions. [2019-11-28 02:46:10,235 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-28 02:46:10,235 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 46 [2019-11-28 02:46:10,236 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 02:46:10,238 INFO L225 Difference]: With dead ends: 319 [2019-11-28 02:46:10,238 INFO L226 Difference]: Without dead ends: 319 [2019-11-28 02:46:10,239 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=45, Invalid=87, Unknown=0, NotChecked=0, Total=132 [2019-11-28 02:46:10,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 319 states. [2019-11-28 02:46:10,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 319 to 301. [2019-11-28 02:46:10,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 301 states. [2019-11-28 02:46:10,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 301 states to 301 states and 402 transitions. [2019-11-28 02:46:10,252 INFO L78 Accepts]: Start accepts. Automaton has 301 states and 402 transitions. Word has length 46 [2019-11-28 02:46:10,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 02:46:10,252 INFO L462 AbstractCegarLoop]: Abstraction has 301 states and 402 transitions. [2019-11-28 02:46:10,252 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-28 02:46:10,252 INFO L276 IsEmpty]: Start isEmpty. Operand 301 states and 402 transitions. [2019-11-28 02:46:10,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-11-28 02:46:10,254 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 02:46:10,255 INFO L410 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] [2019-11-28 02:46:10,255 INFO L410 AbstractCegarLoop]: === Iteration 6 === [errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK]=== [2019-11-28 02:46:10,255 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:46:10,255 INFO L82 PathProgramCache]: Analyzing trace with hash -1615603168, now seen corresponding path program 1 times [2019-11-28 02:46:10,255 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:46:10,256 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [390586620] [2019-11-28 02:46:10,256 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:46:10,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:46:10,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:46:10,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:46:10,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:46:10,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:46:10,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:46:10,452 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 02:46:10,452 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [390586620] [2019-11-28 02:46:10,453 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 02:46:10,454 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-11-28 02:46:10,454 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [281261975] [2019-11-28 02:46:10,455 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-28 02:46:10,456 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:46:10,456 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-28 02:46:10,457 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2019-11-28 02:46:10,457 INFO L87 Difference]: Start difference. First operand 301 states and 402 transitions. Second operand 8 states. [2019-11-28 02:46:10,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:46:10,861 INFO L93 Difference]: Finished difference Result 297 states and 395 transitions. [2019-11-28 02:46:10,862 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-28 02:46:10,862 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 45 [2019-11-28 02:46:10,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 02:46:10,863 INFO L225 Difference]: With dead ends: 297 [2019-11-28 02:46:10,864 INFO L226 Difference]: Without dead ends: 102 [2019-11-28 02:46:10,864 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=49, Invalid=83, Unknown=0, NotChecked=0, Total=132 [2019-11-28 02:46:10,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2019-11-28 02:46:10,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 102. [2019-11-28 02:46:10,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2019-11-28 02:46:10,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 118 transitions. [2019-11-28 02:46:10,870 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 118 transitions. Word has length 45 [2019-11-28 02:46:10,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 02:46:10,871 INFO L462 AbstractCegarLoop]: Abstraction has 102 states and 118 transitions. [2019-11-28 02:46:10,871 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-28 02:46:10,872 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 118 transitions. [2019-11-28 02:46:10,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-11-28 02:46:10,873 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 02:46:10,874 INFO L410 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] [2019-11-28 02:46:10,874 INFO L410 AbstractCegarLoop]: === Iteration 7 === [errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK]=== [2019-11-28 02:46:10,874 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:46:10,875 INFO L82 PathProgramCache]: Analyzing trace with hash -582629432, now seen corresponding path program 1 times [2019-11-28 02:46:10,875 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:46:10,876 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [486084777] [2019-11-28 02:46:10,877 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:46:10,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:46:10,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:46:11,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:46:11,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:46:11,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:46:11,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:46:11,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:46:11,096 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 02:46:11,097 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [486084777] [2019-11-28 02:46:11,097 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 02:46:11,098 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-11-28 02:46:11,098 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1523472321] [2019-11-28 02:46:11,100 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-28 02:46:11,100 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:46:11,101 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-28 02:46:11,102 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-11-28 02:46:11,102 INFO L87 Difference]: Start difference. First operand 102 states and 118 transitions. Second operand 8 states. [2019-11-28 02:46:11,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:46:11,465 INFO L93 Difference]: Finished difference Result 100 states and 114 transitions. [2019-11-28 02:46:11,465 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-28 02:46:11,466 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 53 [2019-11-28 02:46:11,466 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 02:46:11,467 INFO L225 Difference]: With dead ends: 100 [2019-11-28 02:46:11,467 INFO L226 Difference]: Without dead ends: 100 [2019-11-28 02:46:11,468 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 9 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=67, Unknown=0, NotChecked=0, Total=110 [2019-11-28 02:46:11,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2019-11-28 02:46:11,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 100. [2019-11-28 02:46:11,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2019-11-28 02:46:11,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 114 transitions. [2019-11-28 02:46:11,472 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 114 transitions. Word has length 53 [2019-11-28 02:46:11,473 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 02:46:11,473 INFO L462 AbstractCegarLoop]: Abstraction has 100 states and 114 transitions. [2019-11-28 02:46:11,473 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-28 02:46:11,473 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 114 transitions. [2019-11-28 02:46:11,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-11-28 02:46:11,474 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 02:46:11,474 INFO L410 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] [2019-11-28 02:46:11,475 INFO L410 AbstractCegarLoop]: === Iteration 8 === [errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK]=== [2019-11-28 02:46:11,475 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:46:11,475 INFO L82 PathProgramCache]: Analyzing trace with hash 1306380805, now seen corresponding path program 1 times [2019-11-28 02:46:11,475 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:46:11,476 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [256491266] [2019-11-28 02:46:11,476 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:46:11,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:46:11,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:46:11,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:46:11,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:46:11,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:46:11,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:46:11,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:46:11,748 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 02:46:11,749 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [256491266] [2019-11-28 02:46:11,749 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 02:46:11,749 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-11-28 02:46:11,749 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2097243212] [2019-11-28 02:46:11,750 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-11-28 02:46:11,750 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:46:11,751 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-11-28 02:46:11,751 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2019-11-28 02:46:11,751 INFO L87 Difference]: Start difference. First operand 100 states and 114 transitions. Second operand 11 states. [2019-11-28 02:46:11,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:46:11,996 INFO L93 Difference]: Finished difference Result 118 states and 134 transitions. [2019-11-28 02:46:11,996 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-28 02:46:11,997 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 57 [2019-11-28 02:46:11,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 02:46:12,001 INFO L225 Difference]: With dead ends: 118 [2019-11-28 02:46:12,001 INFO L226 Difference]: Without dead ends: 111 [2019-11-28 02:46:12,002 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 10 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2019-11-28 02:46:12,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2019-11-28 02:46:12,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 105. [2019-11-28 02:46:12,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2019-11-28 02:46:12,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 119 transitions. [2019-11-28 02:46:12,011 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 119 transitions. Word has length 57 [2019-11-28 02:46:12,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 02:46:12,012 INFO L462 AbstractCegarLoop]: Abstraction has 105 states and 119 transitions. [2019-11-28 02:46:12,012 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-11-28 02:46:12,012 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 119 transitions. [2019-11-28 02:46:12,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-11-28 02:46:12,015 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 02:46:12,015 INFO L410 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] [2019-11-28 02:46:12,015 INFO L410 AbstractCegarLoop]: === Iteration 9 === [errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK]=== [2019-11-28 02:46:12,016 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:46:12,016 INFO L82 PathProgramCache]: Analyzing trace with hash -538994442, now seen corresponding path program 1 times [2019-11-28 02:46:12,016 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:46:12,017 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1331646001] [2019-11-28 02:46:12,017 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:46:12,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:46:12,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:46:12,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:46:12,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:46:12,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:46:12,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:46:12,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:46:12,260 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 02:46:12,261 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1331646001] [2019-11-28 02:46:12,261 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 02:46:12,261 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-11-28 02:46:12,261 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2081242772] [2019-11-28 02:46:12,262 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-11-28 02:46:12,262 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:46:12,262 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-11-28 02:46:12,263 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2019-11-28 02:46:12,263 INFO L87 Difference]: Start difference. First operand 105 states and 119 transitions. Second operand 11 states. [2019-11-28 02:46:12,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:46:12,667 INFO L93 Difference]: Finished difference Result 109 states and 124 transitions. [2019-11-28 02:46:12,667 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-28 02:46:12,668 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 57 [2019-11-28 02:46:12,668 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 02:46:12,669 INFO L225 Difference]: With dead ends: 109 [2019-11-28 02:46:12,669 INFO L226 Difference]: Without dead ends: 109 [2019-11-28 02:46:12,670 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 10 SyntacticMatches, 2 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=51, Invalid=159, Unknown=0, NotChecked=0, Total=210 [2019-11-28 02:46:12,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2019-11-28 02:46:12,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 106. [2019-11-28 02:46:12,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2019-11-28 02:46:12,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 120 transitions. [2019-11-28 02:46:12,678 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 120 transitions. Word has length 57 [2019-11-28 02:46:12,678 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 02:46:12,679 INFO L462 AbstractCegarLoop]: Abstraction has 106 states and 120 transitions. [2019-11-28 02:46:12,679 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-11-28 02:46:12,679 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 120 transitions. [2019-11-28 02:46:12,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-11-28 02:46:12,680 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 02:46:12,680 INFO L410 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] [2019-11-28 02:46:12,680 INFO L410 AbstractCegarLoop]: === Iteration 10 === [errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK]=== [2019-11-28 02:46:12,681 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:46:12,681 INFO L82 PathProgramCache]: Analyzing trace with hash -914264427, now seen corresponding path program 1 times [2019-11-28 02:46:12,681 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:46:12,682 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1117834580] [2019-11-28 02:46:12,682 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:46:12,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:46:12,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:46:12,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:46:12,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:46:12,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:46:12,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:46:12,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:46:12,862 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 02:46:12,863 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1117834580] [2019-11-28 02:46:12,863 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 02:46:12,863 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-11-28 02:46:12,863 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1751103316] [2019-11-28 02:46:12,864 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-28 02:46:12,864 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:46:12,865 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-28 02:46:12,865 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2019-11-28 02:46:12,865 INFO L87 Difference]: Start difference. First operand 106 states and 120 transitions. Second operand 8 states. [2019-11-28 02:46:13,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:46:13,177 INFO L93 Difference]: Finished difference Result 119 states and 133 transitions. [2019-11-28 02:46:13,178 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-28 02:46:13,178 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 58 [2019-11-28 02:46:13,178 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 02:46:13,179 INFO L225 Difference]: With dead ends: 119 [2019-11-28 02:46:13,179 INFO L226 Difference]: Without dead ends: 117 [2019-11-28 02:46:13,179 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2019-11-28 02:46:13,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2019-11-28 02:46:13,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 108. [2019-11-28 02:46:13,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2019-11-28 02:46:13,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 121 transitions. [2019-11-28 02:46:13,186 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 121 transitions. Word has length 58 [2019-11-28 02:46:13,186 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 02:46:13,186 INFO L462 AbstractCegarLoop]: Abstraction has 108 states and 121 transitions. [2019-11-28 02:46:13,186 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-28 02:46:13,187 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 121 transitions. [2019-11-28 02:46:13,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-11-28 02:46:13,188 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 02:46:13,188 INFO L410 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] [2019-11-28 02:46:13,188 INFO L410 AbstractCegarLoop]: === Iteration 11 === [errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK]=== [2019-11-28 02:46:13,188 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:46:13,189 INFO L82 PathProgramCache]: Analyzing trace with hash 1535327622, now seen corresponding path program 1 times [2019-11-28 02:46:13,189 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:46:13,189 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2027129511] [2019-11-28 02:46:13,189 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:46:13,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:46:13,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:46:13,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:46:13,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:46:13,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:46:13,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:46:13,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:46:13,453 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 02:46:13,453 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2027129511] [2019-11-28 02:46:13,454 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 02:46:13,454 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-11-28 02:46:13,454 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2012205229] [2019-11-28 02:46:13,455 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-28 02:46:13,455 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:46:13,456 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-28 02:46:13,456 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2019-11-28 02:46:13,456 INFO L87 Difference]: Start difference. First operand 108 states and 121 transitions. Second operand 10 states. [2019-11-28 02:46:13,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:46:13,630 INFO L93 Difference]: Finished difference Result 102 states and 112 transitions. [2019-11-28 02:46:13,630 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-28 02:46:13,631 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 58 [2019-11-28 02:46:13,631 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 02:46:13,632 INFO L225 Difference]: With dead ends: 102 [2019-11-28 02:46:13,632 INFO L226 Difference]: Without dead ends: 102 [2019-11-28 02:46:13,632 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2019-11-28 02:46:13,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2019-11-28 02:46:13,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 102. [2019-11-28 02:46:13,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2019-11-28 02:46:13,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 112 transitions. [2019-11-28 02:46:13,640 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 112 transitions. Word has length 58 [2019-11-28 02:46:13,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 02:46:13,642 INFO L462 AbstractCegarLoop]: Abstraction has 102 states and 112 transitions. [2019-11-28 02:46:13,642 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-28 02:46:13,642 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 112 transitions. [2019-11-28 02:46:13,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-11-28 02:46:13,643 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 02:46:13,643 INFO L410 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] [2019-11-28 02:46:13,643 INFO L410 AbstractCegarLoop]: === Iteration 12 === [errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK]=== [2019-11-28 02:46:13,644 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:46:13,644 INFO L82 PathProgramCache]: Analyzing trace with hash 1832020397, now seen corresponding path program 1 times [2019-11-28 02:46:13,644 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:46:13,644 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [432586707] [2019-11-28 02:46:13,645 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:46:13,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:46:13,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:46:13,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:46:13,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:46:13,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:46:13,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:46:13,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:46:13,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:46:13,881 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 02:46:13,881 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [432586707] [2019-11-28 02:46:13,882 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 02:46:13,882 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-11-28 02:46:13,882 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [910299296] [2019-11-28 02:46:13,882 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-11-28 02:46:13,883 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:46:13,883 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-11-28 02:46:13,883 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2019-11-28 02:46:13,883 INFO L87 Difference]: Start difference. First operand 102 states and 112 transitions. Second operand 12 states. [2019-11-28 02:46:14,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:46:14,260 INFO L93 Difference]: Finished difference Result 96 states and 104 transitions. [2019-11-28 02:46:14,261 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-28 02:46:14,261 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 62 [2019-11-28 02:46:14,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 02:46:14,262 INFO L225 Difference]: With dead ends: 96 [2019-11-28 02:46:14,262 INFO L226 Difference]: Without dead ends: 94 [2019-11-28 02:46:14,262 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=88, Invalid=254, Unknown=0, NotChecked=0, Total=342 [2019-11-28 02:46:14,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2019-11-28 02:46:14,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 94. [2019-11-28 02:46:14,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2019-11-28 02:46:14,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 102 transitions. [2019-11-28 02:46:14,267 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 102 transitions. Word has length 62 [2019-11-28 02:46:14,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 02:46:14,267 INFO L462 AbstractCegarLoop]: Abstraction has 94 states and 102 transitions. [2019-11-28 02:46:14,267 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-11-28 02:46:14,267 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 102 transitions. [2019-11-28 02:46:14,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-11-28 02:46:14,269 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 02:46:14,269 INFO L410 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] [2019-11-28 02:46:14,269 INFO L410 AbstractCegarLoop]: === Iteration 13 === [errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK]=== [2019-11-28 02:46:14,270 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:46:14,270 INFO L82 PathProgramCache]: Analyzing trace with hash 198062706, now seen corresponding path program 1 times [2019-11-28 02:46:14,270 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:46:14,270 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [152450893] [2019-11-28 02:46:14,270 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:46:14,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:46:14,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:46:14,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:46:14,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:46:14,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:46:14,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:46:14,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:46:14,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:46:14,469 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 02:46:14,469 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [152450893] [2019-11-28 02:46:14,470 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 02:46:14,470 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-11-28 02:46:14,470 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [377193624] [2019-11-28 02:46:14,470 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-28 02:46:14,471 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:46:14,471 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-28 02:46:14,472 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2019-11-28 02:46:14,472 INFO L87 Difference]: Start difference. First operand 94 states and 102 transitions. Second operand 9 states. [2019-11-28 02:46:14,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:46:14,663 INFO L93 Difference]: Finished difference Result 100 states and 108 transitions. [2019-11-28 02:46:14,664 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-28 02:46:14,664 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 64 [2019-11-28 02:46:14,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 02:46:14,665 INFO L225 Difference]: With dead ends: 100 [2019-11-28 02:46:14,665 INFO L226 Difference]: Without dead ends: 100 [2019-11-28 02:46:14,665 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2019-11-28 02:46:14,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2019-11-28 02:46:14,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 97. [2019-11-28 02:46:14,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2019-11-28 02:46:14,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 105 transitions. [2019-11-28 02:46:14,671 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 105 transitions. Word has length 64 [2019-11-28 02:46:14,671 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 02:46:14,671 INFO L462 AbstractCegarLoop]: Abstraction has 97 states and 105 transitions. [2019-11-28 02:46:14,671 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-28 02:46:14,671 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 105 transitions. [2019-11-28 02:46:14,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-11-28 02:46:14,673 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 02:46:14,673 INFO L410 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] [2019-11-28 02:46:14,674 INFO L410 AbstractCegarLoop]: === Iteration 14 === [errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK]=== [2019-11-28 02:46:14,674 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:46:14,674 INFO L82 PathProgramCache]: Analyzing trace with hash 1883613746, now seen corresponding path program 1 times [2019-11-28 02:46:14,674 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:46:14,675 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1402815176] [2019-11-28 02:46:14,675 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:46:14,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:46:14,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:46:14,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:46:14,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:46:14,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:46:14,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:46:14,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:46:14,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:46:14,936 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 02:46:14,937 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1402815176] [2019-11-28 02:46:14,937 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 02:46:14,937 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-11-28 02:46:14,937 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1796837471] [2019-11-28 02:46:14,938 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-11-28 02:46:14,938 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:46:14,938 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-11-28 02:46:14,938 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=118, Unknown=0, NotChecked=0, Total=156 [2019-11-28 02:46:14,939 INFO L87 Difference]: Start difference. First operand 97 states and 105 transitions. Second operand 13 states. [2019-11-28 02:46:15,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:46:15,276 INFO L93 Difference]: Finished difference Result 97 states and 103 transitions. [2019-11-28 02:46:15,276 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-28 02:46:15,276 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 64 [2019-11-28 02:46:15,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 02:46:15,277 INFO L225 Difference]: With dead ends: 97 [2019-11-28 02:46:15,278 INFO L226 Difference]: Without dead ends: 97 [2019-11-28 02:46:15,278 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=43, Invalid=139, Unknown=0, NotChecked=0, Total=182 [2019-11-28 02:46:15,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2019-11-28 02:46:15,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 97. [2019-11-28 02:46:15,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2019-11-28 02:46:15,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 103 transitions. [2019-11-28 02:46:15,283 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 103 transitions. Word has length 64 [2019-11-28 02:46:15,283 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 02:46:15,284 INFO L462 AbstractCegarLoop]: Abstraction has 97 states and 103 transitions. [2019-11-28 02:46:15,284 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-11-28 02:46:15,284 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 103 transitions. [2019-11-28 02:46:15,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-11-28 02:46:15,285 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 02:46:15,286 INFO L410 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] [2019-11-28 02:46:15,286 INFO L410 AbstractCegarLoop]: === Iteration 15 === [errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK]=== [2019-11-28 02:46:15,286 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:46:15,287 INFO L82 PathProgramCache]: Analyzing trace with hash 1968245100, now seen corresponding path program 1 times [2019-11-28 02:46:15,287 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:46:15,287 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1553060222] [2019-11-28 02:46:15,288 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:46:15,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:46:15,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:46:15,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:46:15,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:46:15,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:46:15,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:46:15,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:46:15,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:46:15,573 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 02:46:15,574 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1553060222] [2019-11-28 02:46:15,574 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 02:46:15,574 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-11-28 02:46:15,574 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1642018762] [2019-11-28 02:46:15,576 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-11-28 02:46:15,576 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:46:15,576 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-11-28 02:46:15,577 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=140, Unknown=0, NotChecked=0, Total=182 [2019-11-28 02:46:15,577 INFO L87 Difference]: Start difference. First operand 97 states and 103 transitions. Second operand 14 states. [2019-11-28 02:46:16,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:46:16,263 INFO L93 Difference]: Finished difference Result 103 states and 108 transitions. [2019-11-28 02:46:16,263 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-11-28 02:46:16,264 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 65 [2019-11-28 02:46:16,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 02:46:16,265 INFO L225 Difference]: With dead ends: 103 [2019-11-28 02:46:16,265 INFO L226 Difference]: Without dead ends: 91 [2019-11-28 02:46:16,265 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=158, Invalid=394, Unknown=0, NotChecked=0, Total=552 [2019-11-28 02:46:16,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2019-11-28 02:46:16,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 82. [2019-11-28 02:46:16,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2019-11-28 02:46:16,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 87 transitions. [2019-11-28 02:46:16,269 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 87 transitions. Word has length 65 [2019-11-28 02:46:16,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 02:46:16,269 INFO L462 AbstractCegarLoop]: Abstraction has 82 states and 87 transitions. [2019-11-28 02:46:16,269 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-11-28 02:46:16,269 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 87 transitions. [2019-11-28 02:46:16,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-11-28 02:46:16,270 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 02:46:16,270 INFO L410 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] [2019-11-28 02:46:16,270 INFO L410 AbstractCegarLoop]: === Iteration 16 === [errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK]=== [2019-11-28 02:46:16,271 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:46:16,271 INFO L82 PathProgramCache]: Analyzing trace with hash -603130258, now seen corresponding path program 1 times [2019-11-28 02:46:16,271 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:46:16,271 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1113402619] [2019-11-28 02:46:16,271 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:46:16,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:46:16,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:46:16,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:46:16,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:46:16,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:46:16,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:46:16,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:46:16,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:46:16,541 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 02:46:16,541 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1113402619] [2019-11-28 02:46:16,541 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 02:46:16,542 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-11-28 02:46:16,542 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [688256683] [2019-11-28 02:46:16,542 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-11-28 02:46:16,542 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:46:16,543 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-11-28 02:46:16,543 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2019-11-28 02:46:16,543 INFO L87 Difference]: Start difference. First operand 82 states and 87 transitions. Second operand 11 states. [2019-11-28 02:46:17,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:46:17,083 INFO L93 Difference]: Finished difference Result 79 states and 82 transitions. [2019-11-28 02:46:17,084 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-11-28 02:46:17,084 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 65 [2019-11-28 02:46:17,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 02:46:17,085 INFO L225 Difference]: With dead ends: 79 [2019-11-28 02:46:17,085 INFO L226 Difference]: Without dead ends: 78 [2019-11-28 02:46:17,086 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=115, Invalid=265, Unknown=0, NotChecked=0, Total=380 [2019-11-28 02:46:17,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2019-11-28 02:46:17,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2019-11-28 02:46:17,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2019-11-28 02:46:17,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 81 transitions. [2019-11-28 02:46:17,090 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 81 transitions. Word has length 65 [2019-11-28 02:46:17,090 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 02:46:17,090 INFO L462 AbstractCegarLoop]: Abstraction has 78 states and 81 transitions. [2019-11-28 02:46:17,091 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-11-28 02:46:17,091 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 81 transitions. [2019-11-28 02:46:17,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-11-28 02:46:17,092 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 02:46:17,092 INFO L410 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] [2019-11-28 02:46:17,092 INFO L410 AbstractCegarLoop]: === Iteration 17 === [errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK]=== [2019-11-28 02:46:17,093 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:46:17,093 INFO L82 PathProgramCache]: Analyzing trace with hash 1151601388, now seen corresponding path program 1 times [2019-11-28 02:46:17,093 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:46:17,093 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1253710812] [2019-11-28 02:46:17,094 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:46:17,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:46:17,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:46:17,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:46:17,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:46:17,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:46:17,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:46:17,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:46:17,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:46:17,357 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 02:46:17,358 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1253710812] [2019-11-28 02:46:17,358 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 02:46:17,358 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-11-28 02:46:17,359 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [111811088] [2019-11-28 02:46:17,359 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-11-28 02:46:17,360 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:46:17,360 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-11-28 02:46:17,360 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2019-11-28 02:46:17,361 INFO L87 Difference]: Start difference. First operand 78 states and 81 transitions. Second operand 12 states. [2019-11-28 02:46:17,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:46:17,633 INFO L93 Difference]: Finished difference Result 78 states and 80 transitions. [2019-11-28 02:46:17,633 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-28 02:46:17,634 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 65 [2019-11-28 02:46:17,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 02:46:17,634 INFO L225 Difference]: With dead ends: 78 [2019-11-28 02:46:17,634 INFO L226 Difference]: Without dead ends: 78 [2019-11-28 02:46:17,635 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 10 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2019-11-28 02:46:17,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2019-11-28 02:46:17,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2019-11-28 02:46:17,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2019-11-28 02:46:17,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 80 transitions. [2019-11-28 02:46:17,638 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 80 transitions. Word has length 65 [2019-11-28 02:46:17,639 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 02:46:17,639 INFO L462 AbstractCegarLoop]: Abstraction has 78 states and 80 transitions. [2019-11-28 02:46:17,639 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-11-28 02:46:17,639 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 80 transitions. [2019-11-28 02:46:17,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-11-28 02:46:17,640 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 02:46:17,640 INFO L410 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] [2019-11-28 02:46:17,641 INFO L410 AbstractCegarLoop]: === Iteration 18 === [errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK]=== [2019-11-28 02:46:17,641 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:46:17,641 INFO L82 PathProgramCache]: Analyzing trace with hash -42695807, now seen corresponding path program 1 times [2019-11-28 02:46:17,641 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:46:17,642 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [608829027] [2019-11-28 02:46:17,642 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:46:17,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:46:17,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:46:17,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:46:17,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:46:17,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:46:17,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:46:17,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:46:17,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:46:17,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:46:17,855 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 02:46:17,856 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [608829027] [2019-11-28 02:46:17,856 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 02:46:17,856 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-11-28 02:46:17,857 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1664585685] [2019-11-28 02:46:17,857 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-11-28 02:46:17,857 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:46:17,858 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-11-28 02:46:17,862 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2019-11-28 02:46:17,862 INFO L87 Difference]: Start difference. First operand 78 states and 80 transitions. Second operand 11 states. [2019-11-28 02:46:18,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:46:18,043 INFO L93 Difference]: Finished difference Result 60 states and 60 transitions. [2019-11-28 02:46:18,043 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-28 02:46:18,043 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 76 [2019-11-28 02:46:18,044 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 02:46:18,044 INFO L225 Difference]: With dead ends: 60 [2019-11-28 02:46:18,044 INFO L226 Difference]: Without dead ends: 0 [2019-11-28 02:46:18,045 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=58, Invalid=98, Unknown=0, NotChecked=0, Total=156 [2019-11-28 02:46:18,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-28 02:46:18,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-28 02:46:18,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-28 02:46:18,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-28 02:46:18,046 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 76 [2019-11-28 02:46:18,046 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 02:46:18,046 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-28 02:46:18,046 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-11-28 02:46:18,046 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-28 02:46:18,047 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-28 02:46:18,051 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.11 02:46:18 BoogieIcfgContainer [2019-11-28 02:46:18,051 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-28 02:46:18,052 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-28 02:46:18,052 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-28 02:46:18,052 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-28 02:46:18,053 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 02:46:03" (3/4) ... [2019-11-28 02:46:18,057 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-11-28 02:46:18,067 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure KeSetEvent [2019-11-28 02:46:18,067 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure KbFilter_Complete [2019-11-28 02:46:18,067 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure stub_driver_init [2019-11-28 02:46:18,067 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure KbFilter_Power [2019-11-28 02:46:18,067 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure _BLAST_init [2019-11-28 02:46:18,067 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure errorFn [2019-11-28 02:46:18,068 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2019-11-28 02:46:18,068 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure IofCallDriver [2019-11-28 02:46:18,068 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure stubMoreProcessingRequired [2019-11-28 02:46:18,068 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure PoCallDriver [2019-11-28 02:46:18,068 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2019-11-28 02:46:18,068 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure KbFilter_CreateClose [2019-11-28 02:46:18,068 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure KbFilter_InternIoCtl [2019-11-28 02:46:18,068 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure KeWaitForSingleObject [2019-11-28 02:46:18,068 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure IofCompleteRequest [2019-11-28 02:46:18,069 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure KbFilter_DispatchPassThrough [2019-11-28 02:46:18,069 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure KbFilter_PnP [2019-11-28 02:46:18,086 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 36 nodes and edges [2019-11-28 02:46:18,088 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 24 nodes and edges [2019-11-28 02:46:18,090 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2019-11-28 02:46:18,315 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-11-28 02:46:18,315 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-28 02:46:18,318 INFO L168 Benchmark]: Toolchain (without parser) took 16887.31 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 374.3 MB). Free memory was 960.4 MB in the beginning and 1.2 GB in the end (delta: -217.9 MB). Peak memory consumption was 156.4 MB. Max. memory is 11.5 GB. [2019-11-28 02:46:18,319 INFO L168 Benchmark]: CDTParser took 0.31 ms. Allocated memory is still 1.0 GB. Free memory is still 987.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 02:46:18,319 INFO L168 Benchmark]: CACSL2BoogieTranslator took 610.21 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 113.2 MB). Free memory was 960.4 MB in the beginning and 1.1 GB in the end (delta: -133.5 MB). Peak memory consumption was 26.2 MB. Max. memory is 11.5 GB. [2019-11-28 02:46:18,320 INFO L168 Benchmark]: Boogie Preprocessor took 113.58 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 02:46:18,320 INFO L168 Benchmark]: RCFGBuilder took 1011.12 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 73.3 MB). Peak memory consumption was 73.3 MB. Max. memory is 11.5 GB. [2019-11-28 02:46:18,321 INFO L168 Benchmark]: TraceAbstraction took 14879.00 ms. Allocated memory was 1.1 GB in the beginning and 1.4 GB in the end (delta: 261.1 MB). Free memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: -169.2 MB). Peak memory consumption was 91.9 MB. Max. memory is 11.5 GB. [2019-11-28 02:46:18,321 INFO L168 Benchmark]: Witness Printer took 263.84 ms. Allocated memory is still 1.4 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 11.5 MB). Peak memory consumption was 11.5 MB. Max. memory is 11.5 GB. [2019-11-28 02:46:18,323 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.31 ms. Allocated memory is still 1.0 GB. Free memory is still 987.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 610.21 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 113.2 MB). Free memory was 960.4 MB in the beginning and 1.1 GB in the end (delta: -133.5 MB). Peak memory consumption was 26.2 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 113.58 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 1011.12 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 73.3 MB). Peak memory consumption was 73.3 MB. Max. memory is 11.5 GB. * TraceAbstraction took 14879.00 ms. Allocated memory was 1.1 GB in the beginning and 1.4 GB in the end (delta: 261.1 MB). Free memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: -169.2 MB). Peak memory consumption was 91.9 MB. Max. memory is 11.5 GB. * Witness Printer took 263.84 ms. Allocated memory is still 1.4 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 11.5 MB). Peak memory consumption was 11.5 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 1011]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 18 procedures, 239 locations, 1 error locations. Result: SAFE, OverallTime: 14.8s, OverallIterations: 18, TraceHistogramMax: 1, AutomataDifference: 9.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 2602 SDtfs, 3191 SDslu, 3420 SDs, 0 SdLazy, 5745 SolverSat, 833 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 6.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 369 GetRequests, 179 SyntacticMatches, 5 SemanticMatches, 185 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 211 ImplicationChecksByTransitivity, 4.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=341occurred in iteration=3, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 18 MinimizatonAttempts, 139 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 3.9s InterpolantComputationTime, 949 NumberOfCodeBlocks, 949 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 931 ConstructedInterpolants, 0 QuantifiedInterpolants, 211466 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 18 InterpolantComputations, 18 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...