./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/ntdrivers-simplified/kbfiltr_simpl2.cil-2.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version f470102c 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/AutomizerReach.xml -i ../sv-benchmarks/c/ntdrivers-simplified/kbfiltr_simpl2.cil-2.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-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 ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 99a77f5372e1d3174eb539425b8da52ff3b34c76 .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.1.25-f470102 [2019-11-28 15:39:51,099 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-28 15:39:51,102 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-28 15:39:51,119 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-28 15:39:51,119 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-28 15:39:51,121 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-28 15:39:51,123 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-28 15:39:51,133 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-28 15:39:51,138 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-28 15:39:51,142 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-28 15:39:51,143 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-28 15:39:51,145 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-28 15:39:51,145 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-28 15:39:51,148 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-28 15:39:51,149 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-28 15:39:51,150 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-28 15:39:51,152 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-28 15:39:51,153 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-28 15:39:51,155 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-28 15:39:51,159 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-28 15:39:51,163 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-28 15:39:51,167 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-28 15:39:51,168 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-28 15:39:51,170 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-28 15:39:51,173 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-28 15:39:51,174 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-28 15:39:51,174 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-28 15:39:51,176 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-28 15:39:51,176 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-28 15:39:51,177 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-28 15:39:51,177 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-28 15:39:51,178 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-28 15:39:51,179 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-28 15:39:51,180 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-28 15:39:51,181 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-28 15:39:51,181 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-28 15:39:51,182 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-28 15:39:51,183 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-28 15:39:51,183 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-28 15:39:51,184 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-28 15:39:51,185 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-28 15:39:51,186 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-28 15:39:51,222 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-28 15:39:51,225 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-28 15:39:51,226 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-28 15:39:51,230 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-28 15:39:51,230 INFO L138 SettingsManager]: * Use SBE=true [2019-11-28 15:39:51,230 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-28 15:39:51,231 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-28 15:39:51,231 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-28 15:39:51,231 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-28 15:39:51,231 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-28 15:39:51,232 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-28 15:39:51,232 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-28 15:39:51,232 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-28 15:39:51,234 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-28 15:39:51,234 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-28 15:39:51,234 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-28 15:39:51,235 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-28 15:39:51,235 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-28 15:39:51,235 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-28 15:39:51,236 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-28 15:39:51,236 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-28 15:39:51,236 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-28 15:39:51,236 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-28 15:39:51,237 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-28 15:39:51,237 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-28 15:39:51,238 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-28 15:39:51,238 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-28 15:39:51,238 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-28 15:39:51,239 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-11-28 15:39:51,239 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 ! call(__VERIFIER_error())) ) 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 -> 99a77f5372e1d3174eb539425b8da52ff3b34c76 [2019-11-28 15:39:51,574 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-28 15:39:51,587 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-28 15:39:51,591 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-28 15:39:51,592 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-28 15:39:51,593 INFO L275 PluginConnector]: CDTParser initialized [2019-11-28 15:39:51,593 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ntdrivers-simplified/kbfiltr_simpl2.cil-2.c [2019-11-28 15:39:51,651 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cb3239b3d/875c61388f9e49e28ef44b53c61c64ae/FLAG4f8651846 [2019-11-28 15:39:52,103 INFO L306 CDTParser]: Found 1 translation units. [2019-11-28 15:39:52,104 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ntdrivers-simplified/kbfiltr_simpl2.cil-2.c [2019-11-28 15:39:52,127 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cb3239b3d/875c61388f9e49e28ef44b53c61c64ae/FLAG4f8651846 [2019-11-28 15:39:52,475 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cb3239b3d/875c61388f9e49e28ef44b53c61c64ae [2019-11-28 15:39:52,478 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-28 15:39:52,480 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-28 15:39:52,481 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-28 15:39:52,481 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-28 15:39:52,486 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-28 15:39:52,487 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 03:39:52" (1/1) ... [2019-11-28 15:39:52,491 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@24c7a7ad and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:39:52, skipping insertion in model container [2019-11-28 15:39:52,491 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 03:39:52" (1/1) ... [2019-11-28 15:39:52,500 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-28 15:39:52,555 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-28 15:39:52,974 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 15:39:52,982 INFO L203 MainTranslator]: Completed pre-run [2019-11-28 15:39:53,092 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 15:39:53,113 INFO L208 MainTranslator]: Completed translation [2019-11-28 15:39:53,114 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:39:53 WrapperNode [2019-11-28 15:39:53,114 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-28 15:39:53,115 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-28 15:39:53,115 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-28 15:39:53,115 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-28 15:39:53,124 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:39:53" (1/1) ... [2019-11-28 15:39:53,138 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:39:53" (1/1) ... [2019-11-28 15:39:53,211 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-28 15:39:53,212 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-28 15:39:53,212 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-28 15:39:53,212 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-28 15:39:53,222 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:39:53" (1/1) ... [2019-11-28 15:39:53,222 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:39:53" (1/1) ... [2019-11-28 15:39:53,229 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:39:53" (1/1) ... [2019-11-28 15:39:53,229 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:39:53" (1/1) ... [2019-11-28 15:39:53,260 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:39:53" (1/1) ... [2019-11-28 15:39:53,280 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:39:53" (1/1) ... [2019-11-28 15:39:53,285 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:39:53" (1/1) ... [2019-11-28 15:39:53,294 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-28 15:39:53,295 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-28 15:39:53,295 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-28 15:39:53,295 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-28 15:39:53,296 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:39:53" (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 15:39:53,357 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-28 15:39:53,357 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-28 15:39:53,611 WARN L738 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-28 15:39:53,620 WARN L738 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-28 15:39:53,627 WARN L738 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-28 15:39:53,634 WARN L738 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-28 15:39:53,637 WARN L738 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-28 15:39:53,641 WARN L738 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-28 15:39:53,645 WARN L738 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-28 15:39:53,650 WARN L738 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-28 15:39:53,654 WARN L738 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-28 15:39:53,657 WARN L738 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-28 15:39:53,659 WARN L738 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-28 15:39:53,666 WARN L738 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-28 15:39:54,600 INFO L691 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##249: assume false; [2019-11-28 15:39:54,601 INFO L691 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##250: assume !false; [2019-11-28 15:39:54,601 INFO L691 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##279: assume false; [2019-11-28 15:39:54,602 INFO L691 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##280: assume !false; [2019-11-28 15:39:54,602 INFO L691 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##219: assume false; [2019-11-28 15:39:54,602 INFO L691 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##220: assume !false; [2019-11-28 15:39:54,602 INFO L691 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##302: assume !false; [2019-11-28 15:39:54,603 INFO L691 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##301: assume false; [2019-11-28 15:39:54,604 INFO L691 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##322: assume !false; [2019-11-28 15:39:54,604 INFO L691 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##321: assume false; [2019-11-28 15:39:54,605 INFO L691 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##85: assume !false; [2019-11-28 15:39:54,605 INFO L691 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##84: assume false; [2019-11-28 15:39:54,605 INFO L691 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##191: assume false; [2019-11-28 15:39:54,606 INFO L691 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##192: assume !false; [2019-11-28 15:39:54,606 INFO L691 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##46: assume !false; [2019-11-28 15:39:54,606 INFO L691 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##45: assume false; [2019-11-28 15:39:54,606 INFO L691 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##140: assume false; [2019-11-28 15:39:54,607 INFO L691 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##141: assume !false; [2019-11-28 15:39:54,607 INFO L691 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##389: assume !false; [2019-11-28 15:39:54,607 INFO L691 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##388: assume false; [2019-11-28 15:39:54,607 INFO L691 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##18: assume false; [2019-11-28 15:39:54,608 INFO L691 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##19: assume !false; [2019-11-28 15:39:54,608 INFO L691 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##162: assume !false; [2019-11-28 15:39:54,608 INFO L691 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##161: assume false; [2019-11-28 15:39:54,610 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-28 15:39:54,610 INFO L287 CfgBuilder]: Removed 154 assume(true) statements. [2019-11-28 15:39:54,612 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 03:39:54 BoogieIcfgContainer [2019-11-28 15:39:54,612 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-28 15:39:54,615 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-28 15:39:54,616 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-28 15:39:54,619 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-28 15:39:54,619 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 03:39:52" (1/3) ... [2019-11-28 15:39:54,621 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@18d6acb6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 03:39:54, skipping insertion in model container [2019-11-28 15:39:54,621 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:39:53" (2/3) ... [2019-11-28 15:39:54,621 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@18d6acb6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 03:39:54, skipping insertion in model container [2019-11-28 15:39:54,622 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 03:39:54" (3/3) ... [2019-11-28 15:39:54,623 INFO L109 eAbstractionObserver]: Analyzing ICFG kbfiltr_simpl2.cil-2.c [2019-11-28 15:39:54,633 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-28 15:39:54,642 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 30 error locations. [2019-11-28 15:39:54,653 INFO L249 AbstractCegarLoop]: Starting to check reachability of 30 error locations. [2019-11-28 15:39:54,681 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-28 15:39:54,681 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-28 15:39:54,681 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-28 15:39:54,681 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-28 15:39:54,681 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-28 15:39:54,681 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-28 15:39:54,682 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-28 15:39:54,682 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-28 15:39:54,712 INFO L276 IsEmpty]: Start isEmpty. Operand 330 states. [2019-11-28 15:39:54,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-11-28 15:39:54,719 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 15:39:54,720 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 15:39:54,721 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 15:39:54,727 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 15:39:54,728 INFO L82 PathProgramCache]: Analyzing trace with hash -1766777508, now seen corresponding path program 1 times [2019-11-28 15:39:54,738 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 15:39:54,738 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [698371201] [2019-11-28 15:39:54,739 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 15:39:54,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 15:39:54,909 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 15:39:54,910 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [698371201] [2019-11-28 15:39:54,911 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 15:39:54,911 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 15:39:54,913 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [617158148] [2019-11-28 15:39:54,918 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 15:39:54,918 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 15:39:54,932 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 15:39:54,933 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 15:39:54,936 INFO L87 Difference]: Start difference. First operand 330 states. Second operand 3 states. [2019-11-28 15:39:55,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 15:39:55,071 INFO L93 Difference]: Finished difference Result 578 states and 842 transitions. [2019-11-28 15:39:55,072 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 15:39:55,074 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2019-11-28 15:39:55,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 15:39:55,089 INFO L225 Difference]: With dead ends: 578 [2019-11-28 15:39:55,090 INFO L226 Difference]: Without dead ends: 324 [2019-11-28 15:39:55,095 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 15:39:55,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 324 states. [2019-11-28 15:39:55,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 324 to 324. [2019-11-28 15:39:55,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 324 states. [2019-11-28 15:39:55,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 324 states to 324 states and 442 transitions. [2019-11-28 15:39:55,164 INFO L78 Accepts]: Start accepts. Automaton has 324 states and 442 transitions. Word has length 11 [2019-11-28 15:39:55,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 15:39:55,164 INFO L462 AbstractCegarLoop]: Abstraction has 324 states and 442 transitions. [2019-11-28 15:39:55,164 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 15:39:55,165 INFO L276 IsEmpty]: Start isEmpty. Operand 324 states and 442 transitions. [2019-11-28 15:39:55,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-11-28 15:39:55,166 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 15:39:55,166 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 15:39:55,166 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 15:39:55,167 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 15:39:55,167 INFO L82 PathProgramCache]: Analyzing trace with hash 557701687, now seen corresponding path program 1 times [2019-11-28 15:39:55,167 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 15:39:55,168 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [413956090] [2019-11-28 15:39:55,168 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 15:39:55,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 15:39:55,291 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 15:39:55,291 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [413956090] [2019-11-28 15:39:55,292 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 15:39:55,292 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 15:39:55,292 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1603758983] [2019-11-28 15:39:55,295 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 15:39:55,296 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 15:39:55,297 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 15:39:55,298 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 15:39:55,298 INFO L87 Difference]: Start difference. First operand 324 states and 442 transitions. Second operand 3 states. [2019-11-28 15:39:55,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 15:39:55,578 INFO L93 Difference]: Finished difference Result 433 states and 577 transitions. [2019-11-28 15:39:55,578 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 15:39:55,578 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-11-28 15:39:55,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 15:39:55,583 INFO L225 Difference]: With dead ends: 433 [2019-11-28 15:39:55,586 INFO L226 Difference]: Without dead ends: 368 [2019-11-28 15:39:55,589 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 15:39:55,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 368 states. [2019-11-28 15:39:55,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 368 to 351. [2019-11-28 15:39:55,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 351 states. [2019-11-28 15:39:55,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 351 states to 351 states and 479 transitions. [2019-11-28 15:39:55,645 INFO L78 Accepts]: Start accepts. Automaton has 351 states and 479 transitions. Word has length 13 [2019-11-28 15:39:55,645 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 15:39:55,645 INFO L462 AbstractCegarLoop]: Abstraction has 351 states and 479 transitions. [2019-11-28 15:39:55,645 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 15:39:55,646 INFO L276 IsEmpty]: Start isEmpty. Operand 351 states and 479 transitions. [2019-11-28 15:39:55,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-11-28 15:39:55,653 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 15:39:55,653 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 15:39:55,654 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 15:39:55,654 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 15:39:55,654 INFO L82 PathProgramCache]: Analyzing trace with hash 1900748477, now seen corresponding path program 1 times [2019-11-28 15:39:55,655 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 15:39:55,655 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1734325098] [2019-11-28 15:39:55,656 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 15:39:55,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 15:39:55,759 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 15:39:55,761 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1734325098] [2019-11-28 15:39:55,761 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 15:39:55,762 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 15:39:55,762 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [424087534] [2019-11-28 15:39:55,762 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 15:39:55,763 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 15:39:55,763 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 15:39:55,763 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 15:39:55,763 INFO L87 Difference]: Start difference. First operand 351 states and 479 transitions. Second operand 3 states. [2019-11-28 15:39:55,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 15:39:55,820 INFO L93 Difference]: Finished difference Result 554 states and 735 transitions. [2019-11-28 15:39:55,821 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 15:39:55,821 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2019-11-28 15:39:55,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 15:39:55,824 INFO L225 Difference]: With dead ends: 554 [2019-11-28 15:39:55,824 INFO L226 Difference]: Without dead ends: 362 [2019-11-28 15:39:55,825 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 15:39:55,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 362 states. [2019-11-28 15:39:55,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 362 to 307. [2019-11-28 15:39:55,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 307 states. [2019-11-28 15:39:55,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 307 states to 307 states and 421 transitions. [2019-11-28 15:39:55,845 INFO L78 Accepts]: Start accepts. Automaton has 307 states and 421 transitions. Word has length 15 [2019-11-28 15:39:55,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 15:39:55,845 INFO L462 AbstractCegarLoop]: Abstraction has 307 states and 421 transitions. [2019-11-28 15:39:55,845 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 15:39:55,846 INFO L276 IsEmpty]: Start isEmpty. Operand 307 states and 421 transitions. [2019-11-28 15:39:55,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-11-28 15:39:55,848 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 15:39:55,848 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] [2019-11-28 15:39:55,849 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 15:39:55,849 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 15:39:55,849 INFO L82 PathProgramCache]: Analyzing trace with hash 306593718, now seen corresponding path program 1 times [2019-11-28 15:39:55,850 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 15:39:55,850 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [26687887] [2019-11-28 15:39:55,850 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 15:39:55,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 15:39:55,911 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 15:39:55,911 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [26687887] [2019-11-28 15:39:55,911 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 15:39:55,912 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 15:39:55,912 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1712705876] [2019-11-28 15:39:55,912 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 15:39:55,912 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 15:39:55,913 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 15:39:55,913 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 15:39:55,913 INFO L87 Difference]: Start difference. First operand 307 states and 421 transitions. Second operand 3 states. [2019-11-28 15:39:56,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 15:39:56,068 INFO L93 Difference]: Finished difference Result 307 states and 421 transitions. [2019-11-28 15:39:56,069 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 15:39:56,069 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2019-11-28 15:39:56,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 15:39:56,071 INFO L225 Difference]: With dead ends: 307 [2019-11-28 15:39:56,071 INFO L226 Difference]: Without dead ends: 293 [2019-11-28 15:39:56,072 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 15:39:56,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 293 states. [2019-11-28 15:39:56,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 293 to 293. [2019-11-28 15:39:56,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 293 states. [2019-11-28 15:39:56,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 293 states to 293 states and 407 transitions. [2019-11-28 15:39:56,086 INFO L78 Accepts]: Start accepts. Automaton has 293 states and 407 transitions. Word has length 21 [2019-11-28 15:39:56,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 15:39:56,086 INFO L462 AbstractCegarLoop]: Abstraction has 293 states and 407 transitions. [2019-11-28 15:39:56,086 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 15:39:56,087 INFO L276 IsEmpty]: Start isEmpty. Operand 293 states and 407 transitions. [2019-11-28 15:39:56,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-11-28 15:39:56,088 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 15:39:56,089 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] [2019-11-28 15:39:56,089 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 15:39:56,089 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 15:39:56,089 INFO L82 PathProgramCache]: Analyzing trace with hash 847063989, now seen corresponding path program 1 times [2019-11-28 15:39:56,090 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 15:39:56,090 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1909761222] [2019-11-28 15:39:56,090 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 15:39:56,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 15:39:56,140 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 15:39:56,141 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1909761222] [2019-11-28 15:39:56,141 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 15:39:56,141 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 15:39:56,141 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1534067690] [2019-11-28 15:39:56,142 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 15:39:56,142 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 15:39:56,142 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 15:39:56,142 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 15:39:56,143 INFO L87 Difference]: Start difference. First operand 293 states and 407 transitions. Second operand 3 states. [2019-11-28 15:39:56,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 15:39:56,177 INFO L93 Difference]: Finished difference Result 304 states and 421 transitions. [2019-11-28 15:39:56,177 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 15:39:56,177 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2019-11-28 15:39:56,178 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 15:39:56,179 INFO L225 Difference]: With dead ends: 304 [2019-11-28 15:39:56,180 INFO L226 Difference]: Without dead ends: 288 [2019-11-28 15:39:56,180 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 15:39:56,182 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 288 states. [2019-11-28 15:39:56,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 288 to 264. [2019-11-28 15:39:56,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 264 states. [2019-11-28 15:39:56,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 264 states to 264 states and 376 transitions. [2019-11-28 15:39:56,199 INFO L78 Accepts]: Start accepts. Automaton has 264 states and 376 transitions. Word has length 26 [2019-11-28 15:39:56,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 15:39:56,200 INFO L462 AbstractCegarLoop]: Abstraction has 264 states and 376 transitions. [2019-11-28 15:39:56,200 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 15:39:56,200 INFO L276 IsEmpty]: Start isEmpty. Operand 264 states and 376 transitions. [2019-11-28 15:39:56,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-11-28 15:39:56,202 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 15:39:56,202 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] [2019-11-28 15:39:56,203 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 15:39:56,204 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 15:39:56,209 INFO L82 PathProgramCache]: Analyzing trace with hash -1660315800, now seen corresponding path program 1 times [2019-11-28 15:39:56,209 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 15:39:56,210 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [552213292] [2019-11-28 15:39:56,211 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 15:39:56,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 15:39:56,295 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 15:39:56,295 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [552213292] [2019-11-28 15:39:56,296 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 15:39:56,296 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 15:39:56,296 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [387699678] [2019-11-28 15:39:56,297 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 15:39:56,298 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 15:39:56,298 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 15:39:56,298 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 15:39:56,298 INFO L87 Difference]: Start difference. First operand 264 states and 376 transitions. Second operand 3 states. [2019-11-28 15:39:56,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 15:39:56,431 INFO L93 Difference]: Finished difference Result 307 states and 430 transitions. [2019-11-28 15:39:56,432 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 15:39:56,432 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2019-11-28 15:39:56,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 15:39:56,434 INFO L225 Difference]: With dead ends: 307 [2019-11-28 15:39:56,434 INFO L226 Difference]: Without dead ends: 261 [2019-11-28 15:39:56,435 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 15:39:56,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 261 states. [2019-11-28 15:39:56,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 261 to 261. [2019-11-28 15:39:56,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 261 states. [2019-11-28 15:39:56,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 261 states to 261 states and 372 transitions. [2019-11-28 15:39:56,452 INFO L78 Accepts]: Start accepts. Automaton has 261 states and 372 transitions. Word has length 27 [2019-11-28 15:39:56,453 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 15:39:56,453 INFO L462 AbstractCegarLoop]: Abstraction has 261 states and 372 transitions. [2019-11-28 15:39:56,454 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 15:39:56,454 INFO L276 IsEmpty]: Start isEmpty. Operand 261 states and 372 transitions. [2019-11-28 15:39:56,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-11-28 15:39:56,455 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 15:39:56,455 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] [2019-11-28 15:39:56,456 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 15:39:56,457 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 15:39:56,457 INFO L82 PathProgramCache]: Analyzing trace with hash -23036524, now seen corresponding path program 1 times [2019-11-28 15:39:56,457 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 15:39:56,458 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1711009765] [2019-11-28 15:39:56,459 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 15:39:56,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 15:39:56,553 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 15:39:56,553 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1711009765] [2019-11-28 15:39:56,554 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 15:39:56,555 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 15:39:56,556 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1101577258] [2019-11-28 15:39:56,556 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 15:39:56,556 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 15:39:56,556 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 15:39:56,557 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 15:39:56,558 INFO L87 Difference]: Start difference. First operand 261 states and 372 transitions. Second operand 3 states. [2019-11-28 15:39:56,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 15:39:56,590 INFO L93 Difference]: Finished difference Result 325 states and 450 transitions. [2019-11-28 15:39:56,591 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 15:39:56,591 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2019-11-28 15:39:56,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 15:39:56,593 INFO L225 Difference]: With dead ends: 325 [2019-11-28 15:39:56,593 INFO L226 Difference]: Without dead ends: 275 [2019-11-28 15:39:56,594 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 15:39:56,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 275 states. [2019-11-28 15:39:56,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 275 to 261. [2019-11-28 15:39:56,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 261 states. [2019-11-28 15:39:56,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 261 states to 261 states and 371 transitions. [2019-11-28 15:39:56,609 INFO L78 Accepts]: Start accepts. Automaton has 261 states and 371 transitions. Word has length 27 [2019-11-28 15:39:56,609 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 15:39:56,609 INFO L462 AbstractCegarLoop]: Abstraction has 261 states and 371 transitions. [2019-11-28 15:39:56,609 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 15:39:56,610 INFO L276 IsEmpty]: Start isEmpty. Operand 261 states and 371 transitions. [2019-11-28 15:39:56,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-11-28 15:39:56,611 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 15:39:56,611 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] [2019-11-28 15:39:56,611 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 15:39:56,612 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 15:39:56,612 INFO L82 PathProgramCache]: Analyzing trace with hash 489558487, now seen corresponding path program 1 times [2019-11-28 15:39:56,612 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 15:39:56,612 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [52687158] [2019-11-28 15:39:56,613 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 15:39:56,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 15:39:56,642 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 15:39:56,642 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [52687158] [2019-11-28 15:39:56,642 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 15:39:56,642 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 15:39:56,643 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1896994534] [2019-11-28 15:39:56,643 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 15:39:56,643 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 15:39:56,644 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 15:39:56,644 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 15:39:56,644 INFO L87 Difference]: Start difference. First operand 261 states and 371 transitions. Second operand 3 states. [2019-11-28 15:39:56,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 15:39:56,756 INFO L93 Difference]: Finished difference Result 276 states and 387 transitions. [2019-11-28 15:39:56,757 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 15:39:56,757 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2019-11-28 15:39:56,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 15:39:56,759 INFO L225 Difference]: With dead ends: 276 [2019-11-28 15:39:56,759 INFO L226 Difference]: Without dead ends: 249 [2019-11-28 15:39:56,760 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 15:39:56,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 249 states. [2019-11-28 15:39:56,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 249 to 249. [2019-11-28 15:39:56,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 249 states. [2019-11-28 15:39:56,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 249 states to 249 states and 347 transitions. [2019-11-28 15:39:56,773 INFO L78 Accepts]: Start accepts. Automaton has 249 states and 347 transitions. Word has length 27 [2019-11-28 15:39:56,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 15:39:56,773 INFO L462 AbstractCegarLoop]: Abstraction has 249 states and 347 transitions. [2019-11-28 15:39:56,774 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 15:39:56,774 INFO L276 IsEmpty]: Start isEmpty. Operand 249 states and 347 transitions. [2019-11-28 15:39:56,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-11-28 15:39:56,775 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 15:39:56,775 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] [2019-11-28 15:39:56,775 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 15:39:56,775 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 15:39:56,776 INFO L82 PathProgramCache]: Analyzing trace with hash 403678015, now seen corresponding path program 1 times [2019-11-28 15:39:56,776 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 15:39:56,776 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1451473854] [2019-11-28 15:39:56,776 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 15:39:56,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 15:39:56,840 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 15:39:56,840 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1451473854] [2019-11-28 15:39:56,841 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 15:39:56,841 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-28 15:39:56,841 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1494995937] [2019-11-28 15:39:56,841 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-28 15:39:56,841 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 15:39:56,842 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-28 15:39:56,842 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-28 15:39:56,842 INFO L87 Difference]: Start difference. First operand 249 states and 347 transitions. Second operand 5 states. [2019-11-28 15:39:57,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 15:39:57,065 INFO L93 Difference]: Finished difference Result 410 states and 537 transitions. [2019-11-28 15:39:57,068 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-28 15:39:57,068 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 30 [2019-11-28 15:39:57,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 15:39:57,070 INFO L225 Difference]: With dead ends: 410 [2019-11-28 15:39:57,071 INFO L226 Difference]: Without dead ends: 359 [2019-11-28 15:39:57,071 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-11-28 15:39:57,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 359 states. [2019-11-28 15:39:57,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 359 to 284. [2019-11-28 15:39:57,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 284 states. [2019-11-28 15:39:57,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 284 states to 284 states and 399 transitions. [2019-11-28 15:39:57,089 INFO L78 Accepts]: Start accepts. Automaton has 284 states and 399 transitions. Word has length 30 [2019-11-28 15:39:57,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 15:39:57,089 INFO L462 AbstractCegarLoop]: Abstraction has 284 states and 399 transitions. [2019-11-28 15:39:57,090 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-28 15:39:57,090 INFO L276 IsEmpty]: Start isEmpty. Operand 284 states and 399 transitions. [2019-11-28 15:39:57,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-11-28 15:39:57,091 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 15:39:57,091 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] [2019-11-28 15:39:57,092 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 15:39:57,092 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 15:39:57,092 INFO L82 PathProgramCache]: Analyzing trace with hash 361661719, now seen corresponding path program 1 times [2019-11-28 15:39:57,092 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 15:39:57,093 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [101494979] [2019-11-28 15:39:57,093 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 15:39:57,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 15:39:57,130 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 15:39:57,131 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [101494979] [2019-11-28 15:39:57,131 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 15:39:57,131 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-28 15:39:57,131 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1997406803] [2019-11-28 15:39:57,131 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-28 15:39:57,132 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 15:39:57,132 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-28 15:39:57,132 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-28 15:39:57,133 INFO L87 Difference]: Start difference. First operand 284 states and 399 transitions. Second operand 5 states. [2019-11-28 15:39:57,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 15:39:57,321 INFO L93 Difference]: Finished difference Result 341 states and 456 transitions. [2019-11-28 15:39:57,321 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-28 15:39:57,321 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 30 [2019-11-28 15:39:57,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 15:39:57,323 INFO L225 Difference]: With dead ends: 341 [2019-11-28 15:39:57,324 INFO L226 Difference]: Without dead ends: 315 [2019-11-28 15:39:57,324 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-11-28 15:39:57,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 315 states. [2019-11-28 15:39:57,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 315 to 271. [2019-11-28 15:39:57,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 271 states. [2019-11-28 15:39:57,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 271 states to 271 states and 381 transitions. [2019-11-28 15:39:57,342 INFO L78 Accepts]: Start accepts. Automaton has 271 states and 381 transitions. Word has length 30 [2019-11-28 15:39:57,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 15:39:57,342 INFO L462 AbstractCegarLoop]: Abstraction has 271 states and 381 transitions. [2019-11-28 15:39:57,342 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-28 15:39:57,342 INFO L276 IsEmpty]: Start isEmpty. Operand 271 states and 381 transitions. [2019-11-28 15:39:57,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-11-28 15:39:57,344 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 15:39:57,344 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] [2019-11-28 15:39:57,344 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 15:39:57,344 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 15:39:57,344 INFO L82 PathProgramCache]: Analyzing trace with hash -959450186, now seen corresponding path program 1 times [2019-11-28 15:39:57,345 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 15:39:57,345 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1210039602] [2019-11-28 15:39:57,345 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 15:39:57,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 15:39:57,403 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 15:39:57,404 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1210039602] [2019-11-28 15:39:57,404 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 15:39:57,404 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-28 15:39:57,405 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1774618360] [2019-11-28 15:39:57,405 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-28 15:39:57,405 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 15:39:57,405 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-28 15:39:57,406 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-11-28 15:39:57,406 INFO L87 Difference]: Start difference. First operand 271 states and 381 transitions. Second operand 7 states. [2019-11-28 15:39:57,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 15:39:57,686 INFO L93 Difference]: Finished difference Result 304 states and 414 transitions. [2019-11-28 15:39:57,687 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-28 15:39:57,687 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 31 [2019-11-28 15:39:57,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 15:39:57,688 INFO L225 Difference]: With dead ends: 304 [2019-11-28 15:39:57,688 INFO L226 Difference]: Without dead ends: 241 [2019-11-28 15:39:57,690 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2019-11-28 15:39:57,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 241 states. [2019-11-28 15:39:57,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 241 to 219. [2019-11-28 15:39:57,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 219 states. [2019-11-28 15:39:57,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 219 states and 307 transitions. [2019-11-28 15:39:57,704 INFO L78 Accepts]: Start accepts. Automaton has 219 states and 307 transitions. Word has length 31 [2019-11-28 15:39:57,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 15:39:57,705 INFO L462 AbstractCegarLoop]: Abstraction has 219 states and 307 transitions. [2019-11-28 15:39:57,705 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-28 15:39:57,705 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 307 transitions. [2019-11-28 15:39:57,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-11-28 15:39:57,706 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 15:39:57,706 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] [2019-11-28 15:39:57,706 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 15:39:57,707 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 15:39:57,707 INFO L82 PathProgramCache]: Analyzing trace with hash -378484437, now seen corresponding path program 1 times [2019-11-28 15:39:57,707 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 15:39:57,707 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1614266401] [2019-11-28 15:39:57,708 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 15:39:57,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 15:39:57,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 15:39:57,749 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1614266401] [2019-11-28 15:39:57,749 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 15:39:57,749 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 15:39:57,749 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1623795046] [2019-11-28 15:39:57,750 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 15:39:57,750 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 15:39:57,750 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 15:39:57,750 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 15:39:57,751 INFO L87 Difference]: Start difference. First operand 219 states and 307 transitions. Second operand 3 states. [2019-11-28 15:39:57,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 15:39:57,783 INFO L93 Difference]: Finished difference Result 435 states and 610 transitions. [2019-11-28 15:39:57,784 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 15:39:57,785 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 31 [2019-11-28 15:39:57,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 15:39:57,788 INFO L225 Difference]: With dead ends: 435 [2019-11-28 15:39:57,788 INFO L226 Difference]: Without dead ends: 431 [2019-11-28 15:39:57,788 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 15:39:57,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 431 states. [2019-11-28 15:39:57,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 431 to 269. [2019-11-28 15:39:57,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 269 states. [2019-11-28 15:39:57,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 269 states to 269 states and 371 transitions. [2019-11-28 15:39:57,807 INFO L78 Accepts]: Start accepts. Automaton has 269 states and 371 transitions. Word has length 31 [2019-11-28 15:39:57,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 15:39:57,807 INFO L462 AbstractCegarLoop]: Abstraction has 269 states and 371 transitions. [2019-11-28 15:39:57,808 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 15:39:57,808 INFO L276 IsEmpty]: Start isEmpty. Operand 269 states and 371 transitions. [2019-11-28 15:39:57,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-11-28 15:39:57,809 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 15:39:57,809 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] [2019-11-28 15:39:57,810 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 15:39:57,810 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 15:39:57,811 INFO L82 PathProgramCache]: Analyzing trace with hash -378424855, now seen corresponding path program 1 times [2019-11-28 15:39:57,811 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 15:39:57,811 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1088384942] [2019-11-28 15:39:57,811 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 15:39:57,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 15:39:57,875 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 15:39:57,875 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1088384942] [2019-11-28 15:39:57,876 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 15:39:57,876 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-28 15:39:57,876 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1396871575] [2019-11-28 15:39:57,876 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-28 15:39:57,876 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 15:39:57,877 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 15:39:57,877 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-28 15:39:57,877 INFO L87 Difference]: Start difference. First operand 269 states and 371 transitions. Second operand 4 states. [2019-11-28 15:39:57,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 15:39:57,916 INFO L93 Difference]: Finished difference Result 315 states and 426 transitions. [2019-11-28 15:39:57,916 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-28 15:39:57,916 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 31 [2019-11-28 15:39:57,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 15:39:57,918 INFO L225 Difference]: With dead ends: 315 [2019-11-28 15:39:57,918 INFO L226 Difference]: Without dead ends: 257 [2019-11-28 15:39:57,919 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-28 15:39:57,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 257 states. [2019-11-28 15:39:57,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 257 to 257. [2019-11-28 15:39:57,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 257 states. [2019-11-28 15:39:57,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 257 states to 257 states and 353 transitions. [2019-11-28 15:39:57,935 INFO L78 Accepts]: Start accepts. Automaton has 257 states and 353 transitions. Word has length 31 [2019-11-28 15:39:57,935 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 15:39:57,935 INFO L462 AbstractCegarLoop]: Abstraction has 257 states and 353 transitions. [2019-11-28 15:39:57,936 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-28 15:39:57,936 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 353 transitions. [2019-11-28 15:39:57,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-11-28 15:39:57,937 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 15:39:57,937 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] [2019-11-28 15:39:57,937 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 15:39:57,938 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 15:39:57,938 INFO L82 PathProgramCache]: Analyzing trace with hash -329006014, now seen corresponding path program 1 times [2019-11-28 15:39:57,938 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 15:39:57,939 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1972504950] [2019-11-28 15:39:57,939 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 15:39:57,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 15:39:57,978 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 15:39:57,979 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1972504950] [2019-11-28 15:39:57,979 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 15:39:57,979 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-28 15:39:57,979 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1476145517] [2019-11-28 15:39:57,980 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-28 15:39:57,980 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 15:39:57,980 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 15:39:57,980 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-28 15:39:57,980 INFO L87 Difference]: Start difference. First operand 257 states and 353 transitions. Second operand 4 states. [2019-11-28 15:39:58,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 15:39:58,098 INFO L93 Difference]: Finished difference Result 291 states and 396 transitions. [2019-11-28 15:39:58,098 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-28 15:39:58,099 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 32 [2019-11-28 15:39:58,099 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 15:39:58,100 INFO L225 Difference]: With dead ends: 291 [2019-11-28 15:39:58,100 INFO L226 Difference]: Without dead ends: 245 [2019-11-28 15:39:58,101 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-28 15:39:58,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 245 states. [2019-11-28 15:39:58,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 245 to 245. [2019-11-28 15:39:58,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 245 states. [2019-11-28 15:39:58,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 245 states to 245 states and 337 transitions. [2019-11-28 15:39:58,118 INFO L78 Accepts]: Start accepts. Automaton has 245 states and 337 transitions. Word has length 32 [2019-11-28 15:39:58,119 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 15:39:58,119 INFO L462 AbstractCegarLoop]: Abstraction has 245 states and 337 transitions. [2019-11-28 15:39:58,119 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-28 15:39:58,119 INFO L276 IsEmpty]: Start isEmpty. Operand 245 states and 337 transitions. [2019-11-28 15:39:58,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-11-28 15:39:58,120 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 15:39:58,120 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] [2019-11-28 15:39:58,120 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 15:39:58,121 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 15:39:58,121 INFO L82 PathProgramCache]: Analyzing trace with hash -793600864, now seen corresponding path program 1 times [2019-11-28 15:39:58,121 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 15:39:58,122 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [813043439] [2019-11-28 15:39:58,122 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 15:39:58,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 15:39:58,178 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 15:39:58,178 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [813043439] [2019-11-28 15:39:58,178 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 15:39:58,179 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-28 15:39:58,179 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1981917381] [2019-11-28 15:39:58,179 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-28 15:39:58,179 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 15:39:58,179 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-28 15:39:58,180 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-28 15:39:58,180 INFO L87 Difference]: Start difference. First operand 245 states and 337 transitions. Second operand 5 states. [2019-11-28 15:39:58,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 15:39:58,376 INFO L93 Difference]: Finished difference Result 276 states and 367 transitions. [2019-11-28 15:39:58,376 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-28 15:39:58,377 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 32 [2019-11-28 15:39:58,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 15:39:58,378 INFO L225 Difference]: With dead ends: 276 [2019-11-28 15:39:58,379 INFO L226 Difference]: Without dead ends: 271 [2019-11-28 15:39:58,379 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-11-28 15:39:58,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 271 states. [2019-11-28 15:39:58,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 271 to 265. [2019-11-28 15:39:58,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 265 states. [2019-11-28 15:39:58,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 265 states to 265 states and 357 transitions. [2019-11-28 15:39:58,406 INFO L78 Accepts]: Start accepts. Automaton has 265 states and 357 transitions. Word has length 32 [2019-11-28 15:39:58,406 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 15:39:58,406 INFO L462 AbstractCegarLoop]: Abstraction has 265 states and 357 transitions. [2019-11-28 15:39:58,406 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-28 15:39:58,406 INFO L276 IsEmpty]: Start isEmpty. Operand 265 states and 357 transitions. [2019-11-28 15:39:58,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-11-28 15:39:58,407 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 15:39:58,408 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] [2019-11-28 15:39:58,408 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 15:39:58,408 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 15:39:58,408 INFO L82 PathProgramCache]: Analyzing trace with hash 778121725, now seen corresponding path program 1 times [2019-11-28 15:39:58,409 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 15:39:58,409 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1301971114] [2019-11-28 15:39:58,409 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 15:39:58,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 15:39:58,443 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 15:39:58,444 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1301971114] [2019-11-28 15:39:58,444 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 15:39:58,444 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-28 15:39:58,444 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1543440722] [2019-11-28 15:39:58,445 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-28 15:39:58,445 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 15:39:58,445 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 15:39:58,445 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-28 15:39:58,446 INFO L87 Difference]: Start difference. First operand 265 states and 357 transitions. Second operand 4 states. [2019-11-28 15:39:58,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 15:39:58,568 INFO L93 Difference]: Finished difference Result 271 states and 362 transitions. [2019-11-28 15:39:58,569 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-28 15:39:58,569 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 33 [2019-11-28 15:39:58,569 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 15:39:58,570 INFO L225 Difference]: With dead ends: 271 [2019-11-28 15:39:58,571 INFO L226 Difference]: Without dead ends: 245 [2019-11-28 15:39:58,571 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-28 15:39:58,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 245 states. [2019-11-28 15:39:58,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 245 to 245. [2019-11-28 15:39:58,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 245 states. [2019-11-28 15:39:58,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 245 states to 245 states and 328 transitions. [2019-11-28 15:39:58,626 INFO L78 Accepts]: Start accepts. Automaton has 245 states and 328 transitions. Word has length 33 [2019-11-28 15:39:58,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 15:39:58,626 INFO L462 AbstractCegarLoop]: Abstraction has 245 states and 328 transitions. [2019-11-28 15:39:58,626 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-28 15:39:58,626 INFO L276 IsEmpty]: Start isEmpty. Operand 245 states and 328 transitions. [2019-11-28 15:39:58,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-11-28 15:39:58,627 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 15:39:58,627 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] [2019-11-28 15:39:58,628 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 15:39:58,628 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 15:39:58,628 INFO L82 PathProgramCache]: Analyzing trace with hash -1781478438, now seen corresponding path program 1 times [2019-11-28 15:39:58,628 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 15:39:58,628 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1922425334] [2019-11-28 15:39:58,628 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 15:39:58,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 15:39:58,661 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 15:39:58,662 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1922425334] [2019-11-28 15:39:58,662 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 15:39:58,662 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 15:39:58,662 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1182334344] [2019-11-28 15:39:58,663 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 15:39:58,663 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 15:39:58,663 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 15:39:58,663 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 15:39:58,664 INFO L87 Difference]: Start difference. First operand 245 states and 328 transitions. Second operand 3 states. [2019-11-28 15:39:58,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 15:39:58,753 INFO L93 Difference]: Finished difference Result 356 states and 458 transitions. [2019-11-28 15:39:58,753 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 15:39:58,753 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 34 [2019-11-28 15:39:58,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 15:39:58,755 INFO L225 Difference]: With dead ends: 356 [2019-11-28 15:39:58,755 INFO L226 Difference]: Without dead ends: 299 [2019-11-28 15:39:58,756 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 15:39:58,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 299 states. [2019-11-28 15:39:58,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 299 to 247. [2019-11-28 15:39:58,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 247 states. [2019-11-28 15:39:58,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 247 states to 247 states and 330 transitions. [2019-11-28 15:39:58,774 INFO L78 Accepts]: Start accepts. Automaton has 247 states and 330 transitions. Word has length 34 [2019-11-28 15:39:58,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 15:39:58,774 INFO L462 AbstractCegarLoop]: Abstraction has 247 states and 330 transitions. [2019-11-28 15:39:58,774 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 15:39:58,774 INFO L276 IsEmpty]: Start isEmpty. Operand 247 states and 330 transitions. [2019-11-28 15:39:58,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-11-28 15:39:58,775 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 15:39:58,775 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] [2019-11-28 15:39:58,775 INFO L410 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 15:39:58,775 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 15:39:58,776 INFO L82 PathProgramCache]: Analyzing trace with hash 1662125936, now seen corresponding path program 1 times [2019-11-28 15:39:58,776 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 15:39:58,776 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [537098834] [2019-11-28 15:39:58,776 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 15:39:58,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 15:39:58,800 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 15:39:58,801 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [537098834] [2019-11-28 15:39:58,801 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 15:39:58,801 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 15:39:58,801 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1763607849] [2019-11-28 15:39:58,802 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 15:39:58,802 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 15:39:58,802 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 15:39:58,802 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 15:39:58,802 INFO L87 Difference]: Start difference. First operand 247 states and 330 transitions. Second operand 3 states. [2019-11-28 15:39:58,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 15:39:58,892 INFO L93 Difference]: Finished difference Result 263 states and 349 transitions. [2019-11-28 15:39:58,893 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 15:39:58,893 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 34 [2019-11-28 15:39:58,894 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 15:39:58,895 INFO L225 Difference]: With dead ends: 263 [2019-11-28 15:39:58,895 INFO L226 Difference]: Without dead ends: 259 [2019-11-28 15:39:58,895 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 15:39:58,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 259 states. [2019-11-28 15:39:58,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 259 to 251. [2019-11-28 15:39:58,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 251 states. [2019-11-28 15:39:58,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 251 states to 251 states and 333 transitions. [2019-11-28 15:39:58,914 INFO L78 Accepts]: Start accepts. Automaton has 251 states and 333 transitions. Word has length 34 [2019-11-28 15:39:58,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 15:39:58,914 INFO L462 AbstractCegarLoop]: Abstraction has 251 states and 333 transitions. [2019-11-28 15:39:58,914 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 15:39:58,914 INFO L276 IsEmpty]: Start isEmpty. Operand 251 states and 333 transitions. [2019-11-28 15:39:58,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-11-28 15:39:58,915 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 15:39:58,915 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] [2019-11-28 15:39:58,916 INFO L410 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 15:39:58,916 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 15:39:58,916 INFO L82 PathProgramCache]: Analyzing trace with hash -822248422, now seen corresponding path program 1 times [2019-11-28 15:39:58,916 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 15:39:58,916 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1982934533] [2019-11-28 15:39:58,917 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 15:39:58,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 15:39:58,955 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 15:39:58,956 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1982934533] [2019-11-28 15:39:58,956 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 15:39:58,956 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-28 15:39:58,956 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [708137209] [2019-11-28 15:39:58,956 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-28 15:39:58,957 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 15:39:58,957 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-28 15:39:58,957 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-28 15:39:58,957 INFO L87 Difference]: Start difference. First operand 251 states and 333 transitions. Second operand 5 states. [2019-11-28 15:39:59,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 15:39:59,127 INFO L93 Difference]: Finished difference Result 304 states and 384 transitions. [2019-11-28 15:39:59,127 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-28 15:39:59,127 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 34 [2019-11-28 15:39:59,127 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 15:39:59,129 INFO L225 Difference]: With dead ends: 304 [2019-11-28 15:39:59,129 INFO L226 Difference]: Without dead ends: 300 [2019-11-28 15:39:59,130 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-11-28 15:39:59,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 300 states. [2019-11-28 15:39:59,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 300 to 251. [2019-11-28 15:39:59,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 251 states. [2019-11-28 15:39:59,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 251 states to 251 states and 331 transitions. [2019-11-28 15:39:59,149 INFO L78 Accepts]: Start accepts. Automaton has 251 states and 331 transitions. Word has length 34 [2019-11-28 15:39:59,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 15:39:59,150 INFO L462 AbstractCegarLoop]: Abstraction has 251 states and 331 transitions. [2019-11-28 15:39:59,150 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-28 15:39:59,150 INFO L276 IsEmpty]: Start isEmpty. Operand 251 states and 331 transitions. [2019-11-28 15:39:59,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-11-28 15:39:59,151 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 15:39:59,151 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] [2019-11-28 15:39:59,151 INFO L410 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 15:39:59,151 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 15:39:59,151 INFO L82 PathProgramCache]: Analyzing trace with hash 1935189253, now seen corresponding path program 1 times [2019-11-28 15:39:59,152 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 15:39:59,152 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [625057951] [2019-11-28 15:39:59,152 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 15:39:59,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 15:39:59,238 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 15:39:59,239 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [625057951] [2019-11-28 15:39:59,239 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 15:39:59,239 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-28 15:39:59,240 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1640083314] [2019-11-28 15:39:59,240 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-28 15:39:59,240 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 15:39:59,240 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-28 15:39:59,241 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-11-28 15:39:59,241 INFO L87 Difference]: Start difference. First operand 251 states and 331 transitions. Second operand 7 states. [2019-11-28 15:39:59,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 15:39:59,407 INFO L93 Difference]: Finished difference Result 269 states and 351 transitions. [2019-11-28 15:39:59,407 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-28 15:39:59,407 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 34 [2019-11-28 15:39:59,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 15:39:59,409 INFO L225 Difference]: With dead ends: 269 [2019-11-28 15:39:59,409 INFO L226 Difference]: Without dead ends: 250 [2019-11-28 15:39:59,409 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2019-11-28 15:39:59,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 250 states. [2019-11-28 15:39:59,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 250 to 250. [2019-11-28 15:39:59,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 250 states. [2019-11-28 15:39:59,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 329 transitions. [2019-11-28 15:39:59,427 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 329 transitions. Word has length 34 [2019-11-28 15:39:59,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 15:39:59,427 INFO L462 AbstractCegarLoop]: Abstraction has 250 states and 329 transitions. [2019-11-28 15:39:59,427 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-28 15:39:59,427 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 329 transitions. [2019-11-28 15:39:59,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-11-28 15:39:59,428 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 15:39:59,428 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] [2019-11-28 15:39:59,429 INFO L410 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 15:39:59,429 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 15:39:59,429 INFO L82 PathProgramCache]: Analyzing trace with hash -21362253, now seen corresponding path program 1 times [2019-11-28 15:39:59,429 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 15:39:59,429 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1723160094] [2019-11-28 15:39:59,430 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 15:39:59,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 15:39:59,466 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 15:39:59,467 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1723160094] [2019-11-28 15:39:59,467 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 15:39:59,467 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 15:39:59,467 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1157544476] [2019-11-28 15:39:59,468 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 15:39:59,468 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 15:39:59,468 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 15:39:59,468 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 15:39:59,468 INFO L87 Difference]: Start difference. First operand 250 states and 329 transitions. Second operand 3 states. [2019-11-28 15:39:59,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 15:39:59,494 INFO L93 Difference]: Finished difference Result 268 states and 349 transitions. [2019-11-28 15:39:59,494 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 15:39:59,494 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 35 [2019-11-28 15:39:59,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 15:39:59,495 INFO L225 Difference]: With dead ends: 268 [2019-11-28 15:39:59,495 INFO L226 Difference]: Without dead ends: 231 [2019-11-28 15:39:59,497 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 15:39:59,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 231 states. [2019-11-28 15:39:59,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 231 to 231. [2019-11-28 15:39:59,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 231 states. [2019-11-28 15:39:59,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 231 states to 231 states and 303 transitions. [2019-11-28 15:39:59,514 INFO L78 Accepts]: Start accepts. Automaton has 231 states and 303 transitions. Word has length 35 [2019-11-28 15:39:59,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 15:39:59,515 INFO L462 AbstractCegarLoop]: Abstraction has 231 states and 303 transitions. [2019-11-28 15:39:59,515 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 15:39:59,515 INFO L276 IsEmpty]: Start isEmpty. Operand 231 states and 303 transitions. [2019-11-28 15:39:59,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-11-28 15:39:59,515 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 15:39:59,516 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] [2019-11-28 15:39:59,516 INFO L410 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 15:39:59,516 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 15:39:59,516 INFO L82 PathProgramCache]: Analyzing trace with hash 272561262, now seen corresponding path program 1 times [2019-11-28 15:39:59,516 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 15:39:59,517 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1779497652] [2019-11-28 15:39:59,517 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 15:39:59,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 15:39:59,594 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 15:39:59,595 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1779497652] [2019-11-28 15:39:59,595 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 15:39:59,595 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-28 15:39:59,595 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1584068224] [2019-11-28 15:39:59,596 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-28 15:39:59,596 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 15:39:59,596 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-28 15:39:59,596 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-28 15:39:59,596 INFO L87 Difference]: Start difference. First operand 231 states and 303 transitions. Second operand 5 states. [2019-11-28 15:39:59,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 15:39:59,727 INFO L93 Difference]: Finished difference Result 289 states and 361 transitions. [2019-11-28 15:39:59,728 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-28 15:39:59,729 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 35 [2019-11-28 15:39:59,729 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 15:39:59,730 INFO L225 Difference]: With dead ends: 289 [2019-11-28 15:39:59,730 INFO L226 Difference]: Without dead ends: 258 [2019-11-28 15:39:59,730 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-11-28 15:39:59,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 258 states. [2019-11-28 15:39:59,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 258 to 231. [2019-11-28 15:39:59,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 231 states. [2019-11-28 15:39:59,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 231 states to 231 states and 297 transitions. [2019-11-28 15:39:59,746 INFO L78 Accepts]: Start accepts. Automaton has 231 states and 297 transitions. Word has length 35 [2019-11-28 15:39:59,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 15:39:59,747 INFO L462 AbstractCegarLoop]: Abstraction has 231 states and 297 transitions. [2019-11-28 15:39:59,747 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-28 15:39:59,747 INFO L276 IsEmpty]: Start isEmpty. Operand 231 states and 297 transitions. [2019-11-28 15:39:59,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-11-28 15:39:59,747 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 15:39:59,748 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] [2019-11-28 15:39:59,748 INFO L410 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 15:39:59,748 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 15:39:59,748 INFO L82 PathProgramCache]: Analyzing trace with hash -2102888975, now seen corresponding path program 1 times [2019-11-28 15:39:59,749 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 15:39:59,749 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1570122176] [2019-11-28 15:39:59,749 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 15:39:59,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 15:39:59,790 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 15:39:59,790 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1570122176] [2019-11-28 15:39:59,791 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 15:39:59,791 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-28 15:39:59,791 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1135070921] [2019-11-28 15:39:59,791 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-28 15:39:59,791 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 15:39:59,792 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-28 15:39:59,792 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-11-28 15:39:59,792 INFO L87 Difference]: Start difference. First operand 231 states and 297 transitions. Second operand 7 states. [2019-11-28 15:39:59,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 15:39:59,979 INFO L93 Difference]: Finished difference Result 255 states and 321 transitions. [2019-11-28 15:39:59,979 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-28 15:39:59,979 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 35 [2019-11-28 15:39:59,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 15:39:59,981 INFO L225 Difference]: With dead ends: 255 [2019-11-28 15:39:59,981 INFO L226 Difference]: Without dead ends: 187 [2019-11-28 15:39:59,981 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2019-11-28 15:39:59,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2019-11-28 15:39:59,993 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 176. [2019-11-28 15:39:59,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 176 states. [2019-11-28 15:39:59,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 214 transitions. [2019-11-28 15:39:59,994 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 214 transitions. Word has length 35 [2019-11-28 15:39:59,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 15:39:59,995 INFO L462 AbstractCegarLoop]: Abstraction has 176 states and 214 transitions. [2019-11-28 15:39:59,995 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-28 15:39:59,995 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 214 transitions. [2019-11-28 15:39:59,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-11-28 15:39:59,995 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 15:39:59,996 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] [2019-11-28 15:39:59,996 INFO L410 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 15:39:59,996 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 15:39:59,996 INFO L82 PathProgramCache]: Analyzing trace with hash 1804254012, now seen corresponding path program 1 times [2019-11-28 15:39:59,996 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 15:39:59,997 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2115663468] [2019-11-28 15:39:59,997 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 15:40:00,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 15:40:00,065 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 15:40:00,065 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2115663468] [2019-11-28 15:40:00,066 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 15:40:00,066 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-28 15:40:00,066 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1798606744] [2019-11-28 15:40:00,066 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-28 15:40:00,067 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 15:40:00,067 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-28 15:40:00,067 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-28 15:40:00,067 INFO L87 Difference]: Start difference. First operand 176 states and 214 transitions. Second operand 6 states. [2019-11-28 15:40:00,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 15:40:00,192 INFO L93 Difference]: Finished difference Result 187 states and 225 transitions. [2019-11-28 15:40:00,192 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-28 15:40:00,192 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 35 [2019-11-28 15:40:00,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 15:40:00,193 INFO L225 Difference]: With dead ends: 187 [2019-11-28 15:40:00,193 INFO L226 Difference]: Without dead ends: 155 [2019-11-28 15:40:00,194 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-11-28 15:40:00,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2019-11-28 15:40:00,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 155. [2019-11-28 15:40:00,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 155 states. [2019-11-28 15:40:00,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 184 transitions. [2019-11-28 15:40:00,206 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 184 transitions. Word has length 35 [2019-11-28 15:40:00,206 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 15:40:00,206 INFO L462 AbstractCegarLoop]: Abstraction has 155 states and 184 transitions. [2019-11-28 15:40:00,206 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-28 15:40:00,206 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 184 transitions. [2019-11-28 15:40:00,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-11-28 15:40:00,207 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 15:40:00,207 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] [2019-11-28 15:40:00,207 INFO L410 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 15:40:00,207 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 15:40:00,207 INFO L82 PathProgramCache]: Analyzing trace with hash -1398430965, now seen corresponding path program 1 times [2019-11-28 15:40:00,208 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 15:40:00,208 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1760079226] [2019-11-28 15:40:00,208 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 15:40:00,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 15:40:00,247 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 15:40:00,247 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1760079226] [2019-11-28 15:40:00,248 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 15:40:00,248 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-28 15:40:00,248 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [35681185] [2019-11-28 15:40:00,249 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-28 15:40:00,249 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 15:40:00,249 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-28 15:40:00,249 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-11-28 15:40:00,249 INFO L87 Difference]: Start difference. First operand 155 states and 184 transitions. Second operand 7 states. [2019-11-28 15:40:00,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 15:40:00,429 INFO L93 Difference]: Finished difference Result 193 states and 224 transitions. [2019-11-28 15:40:00,430 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-28 15:40:00,430 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 36 [2019-11-28 15:40:00,430 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 15:40:00,431 INFO L225 Difference]: With dead ends: 193 [2019-11-28 15:40:00,431 INFO L226 Difference]: Without dead ends: 173 [2019-11-28 15:40:00,432 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2019-11-28 15:40:00,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2019-11-28 15:40:00,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 154. [2019-11-28 15:40:00,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 154 states. [2019-11-28 15:40:00,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 182 transitions. [2019-11-28 15:40:00,448 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 182 transitions. Word has length 36 [2019-11-28 15:40:00,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 15:40:00,449 INFO L462 AbstractCegarLoop]: Abstraction has 154 states and 182 transitions. [2019-11-28 15:40:00,449 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-28 15:40:00,449 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 182 transitions. [2019-11-28 15:40:00,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-11-28 15:40:00,450 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 15:40:00,450 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] [2019-11-28 15:40:00,451 INFO L410 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 15:40:00,451 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 15:40:00,451 INFO L82 PathProgramCache]: Analyzing trace with hash 287352256, now seen corresponding path program 1 times [2019-11-28 15:40:00,452 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 15:40:00,452 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [208550083] [2019-11-28 15:40:00,452 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 15:40:00,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 15:40:00,499 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 15:40:00,500 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [208550083] [2019-11-28 15:40:00,500 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 15:40:00,501 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-28 15:40:00,501 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [112325132] [2019-11-28 15:40:00,501 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-28 15:40:00,502 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 15:40:00,502 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-28 15:40:00,502 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-28 15:40:00,503 INFO L87 Difference]: Start difference. First operand 154 states and 182 transitions. Second operand 6 states. [2019-11-28 15:40:00,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 15:40:00,675 INFO L93 Difference]: Finished difference Result 197 states and 224 transitions. [2019-11-28 15:40:00,676 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-28 15:40:00,676 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 37 [2019-11-28 15:40:00,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 15:40:00,678 INFO L225 Difference]: With dead ends: 197 [2019-11-28 15:40:00,678 INFO L226 Difference]: Without dead ends: 192 [2019-11-28 15:40:00,679 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2019-11-28 15:40:00,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192 states. [2019-11-28 15:40:00,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192 to 167. [2019-11-28 15:40:00,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 167 states. [2019-11-28 15:40:00,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 195 transitions. [2019-11-28 15:40:00,700 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 195 transitions. Word has length 37 [2019-11-28 15:40:00,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 15:40:00,701 INFO L462 AbstractCegarLoop]: Abstraction has 167 states and 195 transitions. [2019-11-28 15:40:00,701 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-28 15:40:00,701 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 195 transitions. [2019-11-28 15:40:00,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-11-28 15:40:00,702 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 15:40:00,702 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] [2019-11-28 15:40:00,702 INFO L410 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 15:40:00,702 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 15:40:00,703 INFO L82 PathProgramCache]: Analyzing trace with hash 724480386, now seen corresponding path program 1 times [2019-11-28 15:40:00,703 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 15:40:00,703 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1479305899] [2019-11-28 15:40:00,703 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 15:40:00,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 15:40:00,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 15:40:00,758 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 15:40:00,759 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-11-28 15:40:00,885 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.11 03:40:00 BoogieIcfgContainer [2019-11-28 15:40:00,885 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-28 15:40:00,885 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-28 15:40:00,886 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-28 15:40:00,886 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-28 15:40:00,887 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 03:39:54" (3/4) ... [2019-11-28 15:40:00,896 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-11-28 15:40:01,093 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-11-28 15:40:01,094 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-28 15:40:01,097 INFO L168 Benchmark]: Toolchain (without parser) took 8615.75 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 331.9 MB). Free memory was 957.7 MB in the beginning and 1.3 GB in the end (delta: -353.5 MB). There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 15:40:01,097 INFO L168 Benchmark]: CDTParser took 0.27 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 15:40:01,098 INFO L168 Benchmark]: CACSL2BoogieTranslator took 633.03 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 133.7 MB). Free memory was 957.7 MB in the beginning and 1.1 GB in the end (delta: -157.6 MB). Peak memory consumption was 26.0 MB. Max. memory is 11.5 GB. [2019-11-28 15:40:01,098 INFO L168 Benchmark]: Boogie Procedure Inliner took 96.91 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. [2019-11-28 15:40:01,099 INFO L168 Benchmark]: Boogie Preprocessor took 82.82 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 15:40:01,099 INFO L168 Benchmark]: RCFGBuilder took 1317.71 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 992.3 MB in the end (delta: 116.4 MB). Peak memory consumption was 116.4 MB. Max. memory is 11.5 GB. [2019-11-28 15:40:01,100 INFO L168 Benchmark]: TraceAbstraction took 6269.66 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 198.2 MB). Free memory was 992.3 MB in the beginning and 1.3 GB in the end (delta: -328.4 MB). Peak memory consumption was 351.8 MB. Max. memory is 11.5 GB. [2019-11-28 15:40:01,100 INFO L168 Benchmark]: Witness Printer took 208.35 ms. Allocated memory is still 1.4 GB. Free memory was 1.3 GB in the beginning and 1.3 GB in the end (delta: 9.5 MB). Peak memory consumption was 9.5 MB. Max. memory is 11.5 GB. [2019-11-28 15:40:01,102 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.27 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 633.03 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 133.7 MB). Free memory was 957.7 MB in the beginning and 1.1 GB in the end (delta: -157.6 MB). Peak memory consumption was 26.0 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 96.91 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 82.82 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 1317.71 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 992.3 MB in the end (delta: 116.4 MB). Peak memory consumption was 116.4 MB. Max. memory is 11.5 GB. * TraceAbstraction took 6269.66 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 198.2 MB). Free memory was 992.3 MB in the beginning and 1.3 GB in the end (delta: -328.4 MB). Peak memory consumption was 351.8 MB. Max. memory is 11.5 GB. * Witness Printer took 208.35 ms. Allocated memory is still 1.4 GB. Free memory was 1.3 GB in the beginning and 1.3 GB in the end (delta: 9.5 MB). Peak memory consumption was 9.5 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 1011]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L21] int KernelMode ; [L22] int Executive ; [L23] int DevicePowerState ; [L24] int s ; [L25] int UNLOADED ; [L26] int NP ; [L27] int DC ; [L28] int SKIP1 ; [L29] int SKIP2 ; [L30] int MPR1 ; [L31] int MPR3 ; [L32] int IPC ; [L33] int pended ; [L34] int compFptr ; [L35] int compRegistered ; [L36] int lowerDriverReturn ; [L37] int setEventCalled ; [L38] int customIrp ; [L39] int myStatus ; VAL [compFptr=0, compRegistered=0, customIrp=0, DC=0, DevicePowerState=0, Executive=0, IPC=0, KernelMode=0, lowerDriverReturn=0, MPR1=0, MPR3=0, myStatus=0, NP=0, pended=0, s=0, setEventCalled=0, SKIP1=0, SKIP2=0, UNLOADED=0] [L292] int status ; [L293] int irp = __VERIFIER_nondet_int() ; [L294] int pirp ; [L295] int pirp__IoStatus__Status ; [L296] int irp_choice = __VERIFIER_nondet_int() ; [L297] int devobj = __VERIFIER_nondet_int() ; [L298] int __cil_tmp8 ; [L300] KernelMode = 0 [L301] Executive = 0 [L302] DevicePowerState = 1 [L303] s = 0 [L304] UNLOADED = 0 [L305] NP = 0 [L306] DC = 0 [L307] SKIP1 = 0 [L308] SKIP2 = 0 [L309] MPR1 = 0 [L310] MPR3 = 0 [L311] IPC = 0 [L312] pended = 0 [L313] compFptr = 0 [L314] compRegistered = 0 [L315] lowerDriverReturn = 0 [L316] setEventCalled = 0 [L317] customIrp = 0 [L318] myStatus = 0 [L322] status = 0 [L323] pirp = irp [L59] UNLOADED = 0 [L60] NP = 1 [L61] DC = 2 [L62] SKIP1 = 3 [L63] SKIP2 = 4 [L64] MPR1 = 5 [L65] MPR3 = 6 [L66] IPC = 7 [L67] s = UNLOADED [L68] pended = 0 [L69] compFptr = 0 [L70] compRegistered = 0 [L71] lowerDriverReturn = 0 [L72] setEventCalled = 0 [L73] customIrp = 0 VAL [compFptr=0, compRegistered=0, customIrp=0, DC=2, DevicePowerState=1, Executive=0, IPC=7, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=0, NP=1, pended=0, s=0, setEventCalled=0, SKIP1=3, SKIP2=4, UNLOADED=0] [L326] COND TRUE status >= 0 [L327] s = NP [L328] customIrp = 0 [L329] setEventCalled = customIrp [L330] lowerDriverReturn = setEventCalled [L331] compRegistered = lowerDriverReturn [L332] pended = compRegistered [L333] pirp__IoStatus__Status = 0 [L334] myStatus = 0 VAL [compFptr=0, compRegistered=0, customIrp=0, DC=2, DevicePowerState=1, Executive=0, IPC=7, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=0, NP=1, pended=0, s=1, setEventCalled=0, SKIP1=3, SKIP2=4, UNLOADED=0] [L335] COND TRUE irp_choice == 0 [L336] pirp__IoStatus__Status = -1073741637 [L337] myStatus = -1073741637 VAL [compFptr=0, compRegistered=0, customIrp=0, DC=2, DevicePowerState=1, Executive=0, IPC=7, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, pended=0, s=1, setEventCalled=0, SKIP1=3, SKIP2=4, UNLOADED=0] [L45] s = NP [L46] pended = 0 [L47] compFptr = 0 [L48] compRegistered = 0 [L49] lowerDriverReturn = 0 [L50] setEventCalled = 0 [L51] customIrp = 0 VAL [compFptr=0, compRegistered=0, customIrp=0, DC=2, DevicePowerState=1, Executive=0, IPC=7, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, pended=0, s=1, setEventCalled=0, SKIP1=3, SKIP2=4, UNLOADED=0] [L343] COND FALSE !(status < 0) [L347] int tmp_ndt_1; [L348] tmp_ndt_1 = __VERIFIER_nondet_int() [L349] COND FALSE !(tmp_ndt_1 == 0) [L352] int tmp_ndt_2; [L353] tmp_ndt_2 = __VERIFIER_nondet_int() [L354] COND FALSE !(tmp_ndt_2 == 1) [L357] int tmp_ndt_3; [L358] tmp_ndt_3 = __VERIFIER_nondet_int() [L359] COND TRUE tmp_ndt_3 == 3 VAL [compFptr=0, compRegistered=0, customIrp=0, DC=2, DevicePowerState=1, Executive=0, IPC=7, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, pended=0, s=1, setEventCalled=0, SKIP1=3, SKIP2=4, UNLOADED=0] [L78] int devExt ; [L79] int irpStack ; [L80] int status ; [L81] int event = __VERIFIER_nondet_int() ; [L82] int DeviceObject__DeviceExtension = __VERIFIER_nondet_int() ; [L83] int Irp__Tail__Overlay__CurrentStackLocation = __VERIFIER_nondet_int() ; [L84] int irpStack__MinorFunction = __VERIFIER_nondet_int() ; [L85] int devExt__TopOfStack = __VERIFIER_nondet_int() ; [L86] int devExt__Started ; [L87] int devExt__Removed ; [L88] int devExt__SurpriseRemoved ; [L89] int Irp__IoStatus__Status ; [L90] int Irp__IoStatus__Information ; [L91] int Irp__CurrentLocation = __VERIFIER_nondet_int() ; [L92] int irpSp ; [L93] int nextIrpSp ; [L94] int nextIrpSp__Control ; [L95] int irpSp___0 ; [L96] int irpSp__Context ; [L97] int irpSp__Control ; [L98] long __cil_tmp23 ; [L101] status = 0 [L102] devExt = DeviceObject__DeviceExtension [L103] irpStack = Irp__Tail__Overlay__CurrentStackLocation VAL [compFptr=0, compRegistered=0, customIrp=0, DC=2, DevicePowerState=1, Executive=0, IPC=7, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, pended=0, s=1, setEventCalled=0, SKIP1=3, SKIP2=4, UNLOADED=0] [L104] COND FALSE !(irpStack__MinorFunction == 0) VAL [compFptr=0, compRegistered=0, customIrp=0, DC=2, DevicePowerState=1, Executive=0, IPC=7, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, pended=0, s=1, setEventCalled=0, SKIP1=3, SKIP2=4, UNLOADED=0] [L107] COND FALSE !(irpStack__MinorFunction == 23) VAL [compFptr=0, compRegistered=0, customIrp=0, DC=2, DevicePowerState=1, Executive=0, IPC=7, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, pended=0, s=1, setEventCalled=0, SKIP1=3, SKIP2=4, UNLOADED=0] [L110] COND TRUE irpStack__MinorFunction == 2 VAL [compFptr=0, compRegistered=0, customIrp=0, DC=2, DevicePowerState=1, Executive=0, IPC=7, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, pended=0, s=1, setEventCalled=0, SKIP1=3, SKIP2=4, UNLOADED=0] [L234] devExt__Removed = 1 VAL [compFptr=0, compRegistered=0, customIrp=0, DC=2, DevicePowerState=1, Executive=0, IPC=7, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, pended=0, s=1, setEventCalled=0, SKIP1=3, SKIP2=4, UNLOADED=0] [L235] COND TRUE s == NP [L236] s = SKIP1 VAL [compFptr=0, compRegistered=0, customIrp=0, DC=2, DevicePowerState=1, Executive=0, IPC=7, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, pended=0, s=3, setEventCalled=0, SKIP1=3, SKIP2=4, UNLOADED=0] [L243] Irp__CurrentLocation ++ [L244] Irp__Tail__Overlay__CurrentStackLocation ++ [L481] int returnVal2 ; [L482] int compRetStatus ; [L483] int lcontext = __VERIFIER_nondet_int() ; [L484] long long __cil_tmp7 ; VAL [compFptr=0, compRegistered=0, customIrp=0, DC=2, DevicePowerState=1, Executive=0, IPC=7, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, pended=0, s=3, setEventCalled=0, SKIP1=3, SKIP2=4, UNLOADED=0] [L487] COND FALSE !(\read(compRegistered)) VAL [compFptr=0, compRegistered=0, customIrp=0, DC=2, DevicePowerState=1, Executive=0, IPC=7, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, pended=0, s=3, setEventCalled=0, SKIP1=3, SKIP2=4, UNLOADED=0] [L500] int tmp_ndt_6; [L501] tmp_ndt_6 = __VERIFIER_nondet_int() [L502] COND FALSE !(tmp_ndt_6 == 0) [L505] int tmp_ndt_7; [L506] tmp_ndt_7 = __VERIFIER_nondet_int() [L507] COND TRUE tmp_ndt_7 == 1 VAL [compFptr=0, compRegistered=0, customIrp=0, DC=2, DevicePowerState=1, Executive=0, IPC=7, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, pended=0, s=3, setEventCalled=0, SKIP1=3, SKIP2=4, UNLOADED=0] [L516] returnVal2 = -1073741823 VAL [compFptr=0, compRegistered=0, customIrp=0, DC=2, DevicePowerState=1, Executive=0, IPC=7, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, pended=0, s=3, setEventCalled=0, SKIP1=3, SKIP2=4, UNLOADED=0] [L526] COND FALSE !(s == NP) VAL [compFptr=0, compRegistered=0, customIrp=0, DC=2, DevicePowerState=1, Executive=0, IPC=7, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, pended=0, s=3, setEventCalled=0, SKIP1=3, SKIP2=4, UNLOADED=0] [L530] COND FALSE !(s == MPR1) VAL [compFptr=0, compRegistered=0, customIrp=0, DC=2, DevicePowerState=1, Executive=0, IPC=7, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, pended=0, s=3, setEventCalled=0, SKIP1=3, SKIP2=4, UNLOADED=0] [L539] COND TRUE s == SKIP1 [L540] s = SKIP2 [L541] lowerDriverReturn = returnVal2 VAL [compFptr=0, compRegistered=0, customIrp=0, DC=2, DevicePowerState=1, Executive=0, IPC=7, KernelMode=0, lowerDriverReturn=-1073741823, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, pended=0, s=4, setEventCalled=0, SKIP1=3, SKIP2=4, UNLOADED=0] [L549] return (returnVal2); VAL [compFptr=0, compRegistered=0, customIrp=0, DC=2, DevicePowerState=1, Executive=0, IPC=7, KernelMode=0, lowerDriverReturn=-1073741823, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, pended=0, s=4, setEventCalled=0, SKIP1=3, SKIP2=4, UNLOADED=0] [L246] status = 0 VAL [compFptr=0, compRegistered=0, customIrp=0, DC=2, DevicePowerState=1, Executive=0, IPC=7, KernelMode=0, lowerDriverReturn=-1073741823, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, pended=0, s=4, setEventCalled=0, SKIP1=3, SKIP2=4, UNLOADED=0] [L288] return (status); VAL [compFptr=0, compRegistered=0, customIrp=0, DC=2, DevicePowerState=1, Executive=0, IPC=7, KernelMode=0, lowerDriverReturn=-1073741823, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, pended=0, s=4, setEventCalled=0, SKIP1=3, SKIP2=4, UNLOADED=0] [L386] status = KbFilter_PnP(devobj, pirp) [L410] COND FALSE !(pended == 1) VAL [compFptr=0, compRegistered=0, customIrp=0, DC=2, DevicePowerState=1, Executive=0, IPC=7, KernelMode=0, lowerDriverReturn=-1073741823, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, pended=0, s=4, setEventCalled=0, SKIP1=3, SKIP2=4, UNLOADED=0] [L418] COND FALSE !(pended == 1) VAL [compFptr=0, compRegistered=0, customIrp=0, DC=2, DevicePowerState=1, Executive=0, IPC=7, KernelMode=0, lowerDriverReturn=-1073741823, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, pended=0, s=4, setEventCalled=0, SKIP1=3, SKIP2=4, UNLOADED=0] [L426] COND TRUE s != UNLOADED VAL [compFptr=0, compRegistered=0, customIrp=0, DC=2, DevicePowerState=1, Executive=0, IPC=7, KernelMode=0, lowerDriverReturn=-1073741823, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, pended=0, s=4, setEventCalled=0, SKIP1=3, SKIP2=4, UNLOADED=0] [L427] COND TRUE status != -1 VAL [compFptr=0, compRegistered=0, customIrp=0, DC=2, DevicePowerState=1, Executive=0, IPC=7, KernelMode=0, lowerDriverReturn=-1073741823, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, pended=0, s=4, setEventCalled=0, SKIP1=3, SKIP2=4, UNLOADED=0] [L428] COND FALSE !(s != SKIP2) VAL [compFptr=0, compRegistered=0, customIrp=0, DC=2, DevicePowerState=1, Executive=0, IPC=7, KernelMode=0, lowerDriverReturn=-1073741823, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, pended=0, s=4, setEventCalled=0, SKIP1=3, SKIP2=4, UNLOADED=0] [L438] COND FALSE !(pended == 1) VAL [compFptr=0, compRegistered=0, customIrp=0, DC=2, DevicePowerState=1, Executive=0, IPC=7, KernelMode=0, lowerDriverReturn=-1073741823, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, pended=0, s=4, setEventCalled=0, SKIP1=3, SKIP2=4, UNLOADED=0] [L445] COND FALSE !(s == DC) VAL [compFptr=0, compRegistered=0, customIrp=0, DC=2, DevicePowerState=1, Executive=0, IPC=7, KernelMode=0, lowerDriverReturn=-1073741823, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, pended=0, s=4, setEventCalled=0, SKIP1=3, SKIP2=4, UNLOADED=0] [L450] COND TRUE status != lowerDriverReturn VAL [compFptr=0, compRegistered=0, customIrp=0, DC=2, DevicePowerState=1, Executive=0, IPC=7, KernelMode=0, lowerDriverReturn=-1073741823, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, pended=0, s=4, setEventCalled=0, SKIP1=3, SKIP2=4, UNLOADED=0] [L1011] __VERIFIER_error() VAL [compFptr=0, compRegistered=0, customIrp=0, DC=2, DevicePowerState=1, Executive=0, IPC=7, KernelMode=0, lowerDriverReturn=-1073741823, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, pended=0, s=4, setEventCalled=0, SKIP1=3, SKIP2=4, UNLOADED=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 330 locations, 30 error locations. Result: UNSAFE, OverallTime: 6.0s, OverallIterations: 27, TraceHistogramMax: 1, AutomataDifference: 3.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 7293 SDtfs, 4529 SDslu, 10689 SDs, 0 SdLazy, 2185 SolverSat, 305 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 154 GetRequests, 54 SyntacticMatches, 1 SemanticMatches, 99 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=351occurred in iteration=2, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.5s AutomataMinimizationTime, 26 MinimizatonAttempts, 610 StatesRemovedByMinimization, 16 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.0s InterpolantComputationTime, 803 NumberOfCodeBlocks, 803 NumberOfCodeBlocksAsserted, 27 NumberOfCheckSat, 740 ConstructedInterpolants, 0 QuantifiedInterpolants, 55626 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 26 InterpolantComputations, 26 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 incorrect! Received shutdown request...