./Ultimate.py --spec /storage/repos/svcomp/c/properties/unreach-call.prp --file /storage/repos/svcomp/c/ntdrivers-simplified/kbfiltr_simpl2_false-unreach-call_true-valid-memsafety_true-termination.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 2e94e6aa Calling Ultimate with: 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 /storage/repos/svcomp/c/ntdrivers-simplified/kbfiltr_simpl2_false-unreach-call_true-valid-memsafety_true-termination.cil.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 e107441daffe219fcef86523aff14082b11c5fb6 ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ 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.24-2e94e6a [2018-12-30 16:04:27,635 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-30 16:04:27,637 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-30 16:04:27,656 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-30 16:04:27,657 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-30 16:04:27,658 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-30 16:04:27,660 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-30 16:04:27,663 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-30 16:04:27,665 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-30 16:04:27,665 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-30 16:04:27,667 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-30 16:04:27,667 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-30 16:04:27,668 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-30 16:04:27,669 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-30 16:04:27,671 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-30 16:04:27,671 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-30 16:04:27,672 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-30 16:04:27,675 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-30 16:04:27,677 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-30 16:04:27,679 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-30 16:04:27,680 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-30 16:04:27,682 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-30 16:04:27,685 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-30 16:04:27,685 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-30 16:04:27,685 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-30 16:04:27,687 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-30 16:04:27,688 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-30 16:04:27,689 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-30 16:04:27,690 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-30 16:04:27,691 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-30 16:04:27,691 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-30 16:04:27,692 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-30 16:04:27,693 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-30 16:04:27,693 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-30 16:04:27,694 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-30 16:04:27,695 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-30 16:04:27,696 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2018-12-30 16:04:27,719 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-30 16:04:27,722 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-30 16:04:27,723 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-30 16:04:27,725 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-30 16:04:27,725 INFO L133 SettingsManager]: * Use SBE=true [2018-12-30 16:04:27,725 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-30 16:04:27,725 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-30 16:04:27,726 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-30 16:04:27,726 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-30 16:04:27,726 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-30 16:04:27,726 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-30 16:04:27,726 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-30 16:04:27,726 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-30 16:04:27,728 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-30 16:04:27,728 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-30 16:04:27,729 INFO L133 SettingsManager]: * Use constant arrays=true [2018-12-30 16:04:27,731 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-30 16:04:27,731 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-30 16:04:27,731 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-30 16:04:27,731 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-30 16:04:27,732 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-30 16:04:27,732 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-30 16:04:27,732 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-30 16:04:27,732 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-30 16:04:27,732 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-30 16:04:27,732 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-12-30 16:04:27,732 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-30 16:04:27,733 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-30 16:04:27,733 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true 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 -> e107441daffe219fcef86523aff14082b11c5fb6 [2018-12-30 16:04:27,812 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-30 16:04:27,831 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-30 16:04:27,839 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-30 16:04:27,841 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-30 16:04:27,841 INFO L276 PluginConnector]: CDTParser initialized [2018-12-30 16:04:27,842 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/ntdrivers-simplified/kbfiltr_simpl2_false-unreach-call_true-valid-memsafety_true-termination.cil.c [2018-12-30 16:04:27,901 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/72da6a786/4795d7241de545bb92697090894be603/FLAG7f9317036 [2018-12-30 16:04:28,401 INFO L307 CDTParser]: Found 1 translation units. [2018-12-30 16:04:28,402 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/ntdrivers-simplified/kbfiltr_simpl2_false-unreach-call_true-valid-memsafety_true-termination.cil.c [2018-12-30 16:04:28,417 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/72da6a786/4795d7241de545bb92697090894be603/FLAG7f9317036 [2018-12-30 16:04:28,724 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/72da6a786/4795d7241de545bb92697090894be603 [2018-12-30 16:04:28,729 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-30 16:04:28,731 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-30 16:04:28,732 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-30 16:04:28,732 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-30 16:04:28,737 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-30 16:04:28,738 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.12 04:04:28" (1/1) ... [2018-12-30 16:04:28,742 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@17ec1835 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.12 04:04:28, skipping insertion in model container [2018-12-30 16:04:28,742 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.12 04:04:28" (1/1) ... [2018-12-30 16:04:28,751 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-30 16:04:28,811 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-30 16:04:29,188 INFO L204 PostProcessor]: Analyzing one entry point: main [2018-12-30 16:04:29,201 INFO L191 MainTranslator]: Completed pre-run [2018-12-30 16:04:29,356 INFO L204 PostProcessor]: Analyzing one entry point: main [2018-12-30 16:04:29,394 INFO L195 MainTranslator]: Completed translation [2018-12-30 16:04:29,395 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.12 04:04:29 WrapperNode [2018-12-30 16:04:29,396 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-30 16:04:29,397 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-30 16:04:29,397 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-30 16:04:29,398 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-30 16:04:29,502 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.12 04:04:29" (1/1) ... [2018-12-30 16:04:29,528 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.12 04:04:29" (1/1) ... [2018-12-30 16:04:29,644 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-30 16:04:29,647 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-30 16:04:29,647 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-30 16:04:29,647 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-30 16:04:29,660 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.12 04:04:29" (1/1) ... [2018-12-30 16:04:29,660 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.12 04:04:29" (1/1) ... [2018-12-30 16:04:29,675 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.12 04:04:29" (1/1) ... [2018-12-30 16:04:29,677 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.12 04:04:29" (1/1) ... [2018-12-30 16:04:29,710 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.12 04:04:29" (1/1) ... [2018-12-30 16:04:29,736 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.12 04:04:29" (1/1) ... [2018-12-30 16:04:29,746 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.12 04:04:29" (1/1) ... [2018-12-30 16:04:29,756 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-30 16:04:29,757 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-30 16:04:29,757 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-30 16:04:29,757 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-30 16:04:29,758 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.12 04:04:29" (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 [2018-12-30 16:04:29,827 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-30 16:04:29,827 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-30 16:04:30,120 WARN L650 $ProcedureCfgBuilder]: Two Gotos in a row! There was dead code [2018-12-30 16:04:30,121 WARN L615 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-12-30 16:04:30,130 WARN L650 $ProcedureCfgBuilder]: Two Gotos in a row! There was dead code [2018-12-30 16:04:30,130 WARN L615 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-12-30 16:04:30,144 WARN L650 $ProcedureCfgBuilder]: Two Gotos in a row! There was dead code [2018-12-30 16:04:30,144 WARN L615 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-12-30 16:04:30,150 WARN L650 $ProcedureCfgBuilder]: Two Gotos in a row! There was dead code [2018-12-30 16:04:30,150 WARN L615 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-12-30 16:04:30,153 WARN L650 $ProcedureCfgBuilder]: Two Gotos in a row! There was dead code [2018-12-30 16:04:30,153 WARN L615 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-12-30 16:04:30,156 WARN L650 $ProcedureCfgBuilder]: Two Gotos in a row! There was dead code [2018-12-30 16:04:30,156 WARN L615 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-12-30 16:04:30,160 WARN L650 $ProcedureCfgBuilder]: Two Gotos in a row! There was dead code [2018-12-30 16:04:30,161 WARN L615 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-12-30 16:04:30,164 WARN L650 $ProcedureCfgBuilder]: Two Gotos in a row! There was dead code [2018-12-30 16:04:30,165 WARN L615 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-12-30 16:04:30,172 WARN L650 $ProcedureCfgBuilder]: Two Gotos in a row! There was dead code [2018-12-30 16:04:30,176 WARN L615 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-12-30 16:04:30,178 WARN L650 $ProcedureCfgBuilder]: Two Gotos in a row! There was dead code [2018-12-30 16:04:30,178 WARN L615 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-12-30 16:04:30,185 WARN L650 $ProcedureCfgBuilder]: Two Gotos in a row! There was dead code [2018-12-30 16:04:30,185 WARN L615 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-12-30 16:04:30,195 WARN L650 $ProcedureCfgBuilder]: Two Gotos in a row! There was dead code [2018-12-30 16:04:30,197 WARN L615 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-12-30 16:04:32,368 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-30 16:04:32,369 INFO L280 CfgBuilder]: Removed 154 assue(true) statements. [2018-12-30 16:04:32,369 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.12 04:04:32 BoogieIcfgContainer [2018-12-30 16:04:32,370 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-30 16:04:32,371 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-30 16:04:32,371 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-30 16:04:32,374 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-30 16:04:32,374 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 30.12 04:04:28" (1/3) ... [2018-12-30 16:04:32,375 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1e89c8b0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.12 04:04:32, skipping insertion in model container [2018-12-30 16:04:32,376 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.12 04:04:29" (2/3) ... [2018-12-30 16:04:32,376 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1e89c8b0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.12 04:04:32, skipping insertion in model container [2018-12-30 16:04:32,376 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.12 04:04:32" (3/3) ... [2018-12-30 16:04:32,378 INFO L112 eAbstractionObserver]: Analyzing ICFG kbfiltr_simpl2_false-unreach-call_true-valid-memsafety_true-termination.cil.c [2018-12-30 16:04:32,388 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-30 16:04:32,396 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 30 error locations. [2018-12-30 16:04:32,414 INFO L257 AbstractCegarLoop]: Starting to check reachability of 30 error locations. [2018-12-30 16:04:32,457 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-12-30 16:04:32,458 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-30 16:04:32,458 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-30 16:04:32,459 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-30 16:04:32,459 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-30 16:04:32,459 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-30 16:04:32,459 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-30 16:04:32,459 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-30 16:04:32,459 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-30 16:04:32,490 INFO L276 IsEmpty]: Start isEmpty. Operand 330 states. [2018-12-30 16:04:32,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-30 16:04:32,498 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 16:04:32,499 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-30 16:04:32,503 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 16:04:32,509 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 16:04:32,510 INFO L82 PathProgramCache]: Analyzing trace with hash -1766777508, now seen corresponding path program 1 times [2018-12-30 16:04:32,512 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 16:04:32,512 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 16:04:32,561 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:04:32,561 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 16:04:32,561 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:04:32,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 16:04:32,690 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-30 16:04:32,693 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 16:04:32,693 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-30 16:04:32,698 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-30 16:04:32,711 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-30 16:04:32,712 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 16:04:32,714 INFO L87 Difference]: Start difference. First operand 330 states. Second operand 3 states. [2018-12-30 16:04:32,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 16:04:32,973 INFO L93 Difference]: Finished difference Result 578 states and 842 transitions. [2018-12-30 16:04:32,975 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-30 16:04:32,977 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2018-12-30 16:04:32,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 16:04:32,996 INFO L225 Difference]: With dead ends: 578 [2018-12-30 16:04:32,996 INFO L226 Difference]: Without dead ends: 324 [2018-12-30 16:04:33,002 INFO L631 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 [2018-12-30 16:04:33,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 324 states. [2018-12-30 16:04:33,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 324 to 324. [2018-12-30 16:04:33,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 324 states. [2018-12-30 16:04:33,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 324 states to 324 states and 442 transitions. [2018-12-30 16:04:33,086 INFO L78 Accepts]: Start accepts. Automaton has 324 states and 442 transitions. Word has length 11 [2018-12-30 16:04:33,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 16:04:33,086 INFO L480 AbstractCegarLoop]: Abstraction has 324 states and 442 transitions. [2018-12-30 16:04:33,087 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-30 16:04:33,087 INFO L276 IsEmpty]: Start isEmpty. Operand 324 states and 442 transitions. [2018-12-30 16:04:33,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-12-30 16:04:33,091 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 16:04:33,091 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-30 16:04:33,093 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 16:04:33,093 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 16:04:33,093 INFO L82 PathProgramCache]: Analyzing trace with hash 557701687, now seen corresponding path program 1 times [2018-12-30 16:04:33,094 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 16:04:33,094 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 16:04:33,095 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:04:33,095 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 16:04:33,096 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:04:33,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 16:04:33,188 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-30 16:04:33,188 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 16:04:33,188 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-30 16:04:33,191 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-30 16:04:33,191 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-30 16:04:33,191 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 16:04:33,192 INFO L87 Difference]: Start difference. First operand 324 states and 442 transitions. Second operand 3 states. [2018-12-30 16:04:34,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 16:04:34,039 INFO L93 Difference]: Finished difference Result 433 states and 577 transitions. [2018-12-30 16:04:34,039 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-30 16:04:34,039 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2018-12-30 16:04:34,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 16:04:34,043 INFO L225 Difference]: With dead ends: 433 [2018-12-30 16:04:34,044 INFO L226 Difference]: Without dead ends: 368 [2018-12-30 16:04:34,045 INFO L631 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 [2018-12-30 16:04:34,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 368 states. [2018-12-30 16:04:34,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 368 to 351. [2018-12-30 16:04:34,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 351 states. [2018-12-30 16:04:34,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 351 states to 351 states and 479 transitions. [2018-12-30 16:04:34,084 INFO L78 Accepts]: Start accepts. Automaton has 351 states and 479 transitions. Word has length 13 [2018-12-30 16:04:34,084 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 16:04:34,084 INFO L480 AbstractCegarLoop]: Abstraction has 351 states and 479 transitions. [2018-12-30 16:04:34,085 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-30 16:04:34,085 INFO L276 IsEmpty]: Start isEmpty. Operand 351 states and 479 transitions. [2018-12-30 16:04:34,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-12-30 16:04:34,086 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 16:04:34,086 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-30 16:04:34,088 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 16:04:34,089 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 16:04:34,089 INFO L82 PathProgramCache]: Analyzing trace with hash 1900748477, now seen corresponding path program 1 times [2018-12-30 16:04:34,089 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 16:04:34,089 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 16:04:34,090 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:04:34,090 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 16:04:34,091 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:04:34,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 16:04:34,209 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-30 16:04:34,209 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 16:04:34,210 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-30 16:04:34,210 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-30 16:04:34,210 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-30 16:04:34,211 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 16:04:34,211 INFO L87 Difference]: Start difference. First operand 351 states and 479 transitions. Second operand 3 states. [2018-12-30 16:04:34,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 16:04:34,382 INFO L93 Difference]: Finished difference Result 554 states and 735 transitions. [2018-12-30 16:04:34,387 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-30 16:04:34,387 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2018-12-30 16:04:34,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 16:04:34,391 INFO L225 Difference]: With dead ends: 554 [2018-12-30 16:04:34,391 INFO L226 Difference]: Without dead ends: 362 [2018-12-30 16:04:34,396 INFO L631 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 [2018-12-30 16:04:34,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 362 states. [2018-12-30 16:04:34,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 362 to 307. [2018-12-30 16:04:34,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 307 states. [2018-12-30 16:04:34,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 307 states to 307 states and 421 transitions. [2018-12-30 16:04:34,448 INFO L78 Accepts]: Start accepts. Automaton has 307 states and 421 transitions. Word has length 15 [2018-12-30 16:04:34,448 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 16:04:34,448 INFO L480 AbstractCegarLoop]: Abstraction has 307 states and 421 transitions. [2018-12-30 16:04:34,449 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-30 16:04:34,449 INFO L276 IsEmpty]: Start isEmpty. Operand 307 states and 421 transitions. [2018-12-30 16:04:34,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-12-30 16:04:34,452 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 16:04:34,452 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-30 16:04:34,454 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 16:04:34,454 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 16:04:34,454 INFO L82 PathProgramCache]: Analyzing trace with hash 306593718, now seen corresponding path program 1 times [2018-12-30 16:04:34,454 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 16:04:34,455 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 16:04:34,456 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:04:34,457 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 16:04:34,457 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:04:34,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 16:04:34,589 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-30 16:04:34,589 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 16:04:34,589 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-30 16:04:34,590 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-30 16:04:34,590 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-30 16:04:34,590 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 16:04:34,591 INFO L87 Difference]: Start difference. First operand 307 states and 421 transitions. Second operand 3 states. [2018-12-30 16:04:35,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 16:04:35,231 INFO L93 Difference]: Finished difference Result 307 states and 421 transitions. [2018-12-30 16:04:35,235 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-30 16:04:35,236 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2018-12-30 16:04:35,236 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 16:04:35,238 INFO L225 Difference]: With dead ends: 307 [2018-12-30 16:04:35,238 INFO L226 Difference]: Without dead ends: 293 [2018-12-30 16:04:35,239 INFO L631 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 [2018-12-30 16:04:35,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 293 states. [2018-12-30 16:04:35,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 293 to 293. [2018-12-30 16:04:35,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 293 states. [2018-12-30 16:04:35,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 293 states to 293 states and 407 transitions. [2018-12-30 16:04:35,264 INFO L78 Accepts]: Start accepts. Automaton has 293 states and 407 transitions. Word has length 21 [2018-12-30 16:04:35,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 16:04:35,265 INFO L480 AbstractCegarLoop]: Abstraction has 293 states and 407 transitions. [2018-12-30 16:04:35,265 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-30 16:04:35,265 INFO L276 IsEmpty]: Start isEmpty. Operand 293 states and 407 transitions. [2018-12-30 16:04:35,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-12-30 16:04:35,275 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 16:04:35,275 INFO L402 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] [2018-12-30 16:04:35,277 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 16:04:35,277 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 16:04:35,277 INFO L82 PathProgramCache]: Analyzing trace with hash 847063989, now seen corresponding path program 1 times [2018-12-30 16:04:35,277 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 16:04:35,277 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 16:04:35,281 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:04:35,281 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 16:04:35,281 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:04:35,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 16:04:35,375 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-30 16:04:35,375 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 16:04:35,376 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-30 16:04:35,376 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-30 16:04:35,376 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-30 16:04:35,376 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 16:04:35,377 INFO L87 Difference]: Start difference. First operand 293 states and 407 transitions. Second operand 3 states. [2018-12-30 16:04:35,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 16:04:35,465 INFO L93 Difference]: Finished difference Result 304 states and 421 transitions. [2018-12-30 16:04:35,466 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-30 16:04:35,466 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2018-12-30 16:04:35,466 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 16:04:35,468 INFO L225 Difference]: With dead ends: 304 [2018-12-30 16:04:35,468 INFO L226 Difference]: Without dead ends: 288 [2018-12-30 16:04:35,469 INFO L631 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 [2018-12-30 16:04:35,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 288 states. [2018-12-30 16:04:35,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 288 to 264. [2018-12-30 16:04:35,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 264 states. [2018-12-30 16:04:35,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 264 states to 264 states and 376 transitions. [2018-12-30 16:04:35,489 INFO L78 Accepts]: Start accepts. Automaton has 264 states and 376 transitions. Word has length 26 [2018-12-30 16:04:35,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 16:04:35,489 INFO L480 AbstractCegarLoop]: Abstraction has 264 states and 376 transitions. [2018-12-30 16:04:35,489 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-30 16:04:35,489 INFO L276 IsEmpty]: Start isEmpty. Operand 264 states and 376 transitions. [2018-12-30 16:04:35,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-12-30 16:04:35,491 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 16:04:35,491 INFO L402 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] [2018-12-30 16:04:35,492 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 16:04:35,493 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 16:04:35,493 INFO L82 PathProgramCache]: Analyzing trace with hash -1660315800, now seen corresponding path program 1 times [2018-12-30 16:04:35,493 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 16:04:35,493 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 16:04:35,494 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:04:35,494 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 16:04:35,494 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:04:35,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 16:04:35,601 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-30 16:04:35,601 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 16:04:35,601 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-30 16:04:35,601 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-30 16:04:35,602 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-30 16:04:35,602 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 16:04:35,602 INFO L87 Difference]: Start difference. First operand 264 states and 376 transitions. Second operand 3 states. [2018-12-30 16:04:36,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 16:04:36,227 INFO L93 Difference]: Finished difference Result 307 states and 430 transitions. [2018-12-30 16:04:36,227 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-30 16:04:36,227 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2018-12-30 16:04:36,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 16:04:36,229 INFO L225 Difference]: With dead ends: 307 [2018-12-30 16:04:36,229 INFO L226 Difference]: Without dead ends: 261 [2018-12-30 16:04:36,230 INFO L631 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 [2018-12-30 16:04:36,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 261 states. [2018-12-30 16:04:36,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 261 to 261. [2018-12-30 16:04:36,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 261 states. [2018-12-30 16:04:36,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 261 states to 261 states and 372 transitions. [2018-12-30 16:04:36,250 INFO L78 Accepts]: Start accepts. Automaton has 261 states and 372 transitions. Word has length 27 [2018-12-30 16:04:36,250 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 16:04:36,250 INFO L480 AbstractCegarLoop]: Abstraction has 261 states and 372 transitions. [2018-12-30 16:04:36,251 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-30 16:04:36,251 INFO L276 IsEmpty]: Start isEmpty. Operand 261 states and 372 transitions. [2018-12-30 16:04:36,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-12-30 16:04:36,252 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 16:04:36,252 INFO L402 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] [2018-12-30 16:04:36,254 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 16:04:36,254 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 16:04:36,254 INFO L82 PathProgramCache]: Analyzing trace with hash -23036524, now seen corresponding path program 1 times [2018-12-30 16:04:36,254 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 16:04:36,254 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 16:04:36,255 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:04:36,255 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 16:04:36,260 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:04:36,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 16:04:36,364 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-30 16:04:36,365 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 16:04:36,365 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-30 16:04:36,365 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-30 16:04:36,365 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-30 16:04:36,366 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 16:04:36,367 INFO L87 Difference]: Start difference. First operand 261 states and 372 transitions. Second operand 3 states. [2018-12-30 16:04:36,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 16:04:36,459 INFO L93 Difference]: Finished difference Result 325 states and 450 transitions. [2018-12-30 16:04:36,460 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-30 16:04:36,460 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2018-12-30 16:04:36,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 16:04:36,463 INFO L225 Difference]: With dead ends: 325 [2018-12-30 16:04:36,463 INFO L226 Difference]: Without dead ends: 275 [2018-12-30 16:04:36,464 INFO L631 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 [2018-12-30 16:04:36,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 275 states. [2018-12-30 16:04:36,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 275 to 261. [2018-12-30 16:04:36,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 261 states. [2018-12-30 16:04:36,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 261 states to 261 states and 371 transitions. [2018-12-30 16:04:36,486 INFO L78 Accepts]: Start accepts. Automaton has 261 states and 371 transitions. Word has length 27 [2018-12-30 16:04:36,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 16:04:36,486 INFO L480 AbstractCegarLoop]: Abstraction has 261 states and 371 transitions. [2018-12-30 16:04:36,486 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-30 16:04:36,486 INFO L276 IsEmpty]: Start isEmpty. Operand 261 states and 371 transitions. [2018-12-30 16:04:36,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-12-30 16:04:36,489 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 16:04:36,489 INFO L402 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] [2018-12-30 16:04:36,491 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 16:04:36,491 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 16:04:36,492 INFO L82 PathProgramCache]: Analyzing trace with hash 489558487, now seen corresponding path program 1 times [2018-12-30 16:04:36,492 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 16:04:36,492 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 16:04:36,495 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:04:36,495 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 16:04:36,495 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:04:36,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 16:04:36,607 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-30 16:04:36,608 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 16:04:36,608 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-30 16:04:36,608 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-30 16:04:36,610 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-30 16:04:36,610 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 16:04:36,611 INFO L87 Difference]: Start difference. First operand 261 states and 371 transitions. Second operand 3 states. [2018-12-30 16:04:37,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 16:04:37,037 INFO L93 Difference]: Finished difference Result 276 states and 387 transitions. [2018-12-30 16:04:37,038 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-30 16:04:37,039 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2018-12-30 16:04:37,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 16:04:37,040 INFO L225 Difference]: With dead ends: 276 [2018-12-30 16:04:37,041 INFO L226 Difference]: Without dead ends: 249 [2018-12-30 16:04:37,041 INFO L631 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 [2018-12-30 16:04:37,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 249 states. [2018-12-30 16:04:37,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 249 to 249. [2018-12-30 16:04:37,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 249 states. [2018-12-30 16:04:37,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 249 states to 249 states and 347 transitions. [2018-12-30 16:04:37,087 INFO L78 Accepts]: Start accepts. Automaton has 249 states and 347 transitions. Word has length 27 [2018-12-30 16:04:37,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 16:04:37,090 INFO L480 AbstractCegarLoop]: Abstraction has 249 states and 347 transitions. [2018-12-30 16:04:37,090 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-30 16:04:37,090 INFO L276 IsEmpty]: Start isEmpty. Operand 249 states and 347 transitions. [2018-12-30 16:04:37,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-12-30 16:04:37,091 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 16:04:37,091 INFO L402 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] [2018-12-30 16:04:37,092 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 16:04:37,093 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 16:04:37,094 INFO L82 PathProgramCache]: Analyzing trace with hash 403678015, now seen corresponding path program 1 times [2018-12-30 16:04:37,094 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 16:04:37,094 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 16:04:37,095 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:04:37,095 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 16:04:37,095 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:04:37,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 16:04:37,213 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-30 16:04:37,213 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 16:04:37,213 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-30 16:04:37,214 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-30 16:04:37,214 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-30 16:04:37,214 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-30 16:04:37,214 INFO L87 Difference]: Start difference. First operand 249 states and 347 transitions. Second operand 5 states. [2018-12-30 16:04:38,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 16:04:38,783 INFO L93 Difference]: Finished difference Result 410 states and 537 transitions. [2018-12-30 16:04:38,787 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-30 16:04:38,787 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 30 [2018-12-30 16:04:38,787 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 16:04:38,789 INFO L225 Difference]: With dead ends: 410 [2018-12-30 16:04:38,790 INFO L226 Difference]: Without dead ends: 359 [2018-12-30 16:04:38,791 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-12-30 16:04:38,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 359 states. [2018-12-30 16:04:38,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 359 to 284. [2018-12-30 16:04:38,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 284 states. [2018-12-30 16:04:38,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 284 states to 284 states and 399 transitions. [2018-12-30 16:04:38,812 INFO L78 Accepts]: Start accepts. Automaton has 284 states and 399 transitions. Word has length 30 [2018-12-30 16:04:38,812 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 16:04:38,812 INFO L480 AbstractCegarLoop]: Abstraction has 284 states and 399 transitions. [2018-12-30 16:04:38,812 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-30 16:04:38,814 INFO L276 IsEmpty]: Start isEmpty. Operand 284 states and 399 transitions. [2018-12-30 16:04:38,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-12-30 16:04:38,815 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 16:04:38,815 INFO L402 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] [2018-12-30 16:04:38,817 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 16:04:38,817 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 16:04:38,817 INFO L82 PathProgramCache]: Analyzing trace with hash 361661719, now seen corresponding path program 1 times [2018-12-30 16:04:38,817 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 16:04:38,818 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 16:04:38,819 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:04:38,820 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 16:04:38,821 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:04:38,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 16:04:39,077 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-30 16:04:39,078 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 16:04:39,078 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-30 16:04:39,078 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-30 16:04:39,079 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-30 16:04:39,079 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-30 16:04:39,079 INFO L87 Difference]: Start difference. First operand 284 states and 399 transitions. Second operand 5 states. [2018-12-30 16:04:39,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 16:04:39,703 INFO L93 Difference]: Finished difference Result 341 states and 456 transitions. [2018-12-30 16:04:39,712 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-30 16:04:39,712 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 30 [2018-12-30 16:04:39,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 16:04:39,714 INFO L225 Difference]: With dead ends: 341 [2018-12-30 16:04:39,714 INFO L226 Difference]: Without dead ends: 315 [2018-12-30 16:04:39,715 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-12-30 16:04:39,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 315 states. [2018-12-30 16:04:39,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 315 to 271. [2018-12-30 16:04:39,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 271 states. [2018-12-30 16:04:39,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 271 states to 271 states and 381 transitions. [2018-12-30 16:04:39,734 INFO L78 Accepts]: Start accepts. Automaton has 271 states and 381 transitions. Word has length 30 [2018-12-30 16:04:39,734 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 16:04:39,734 INFO L480 AbstractCegarLoop]: Abstraction has 271 states and 381 transitions. [2018-12-30 16:04:39,735 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-30 16:04:39,735 INFO L276 IsEmpty]: Start isEmpty. Operand 271 states and 381 transitions. [2018-12-30 16:04:39,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-12-30 16:04:39,736 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 16:04:39,736 INFO L402 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] [2018-12-30 16:04:39,737 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 16:04:39,737 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 16:04:39,737 INFO L82 PathProgramCache]: Analyzing trace with hash -959450186, now seen corresponding path program 1 times [2018-12-30 16:04:39,737 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 16:04:39,738 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 16:04:39,739 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:04:39,739 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 16:04:39,739 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:04:39,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 16:04:40,256 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-30 16:04:40,256 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 16:04:40,257 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-30 16:04:40,257 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-30 16:04:40,257 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-30 16:04:40,257 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-12-30 16:04:40,257 INFO L87 Difference]: Start difference. First operand 271 states and 381 transitions. Second operand 7 states. [2018-12-30 16:04:41,293 WARN L181 SmtUtils]: Spent 103.00 ms on a formula simplification that was a NOOP. DAG size: 8 [2018-12-30 16:04:42,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 16:04:42,667 INFO L93 Difference]: Finished difference Result 304 states and 414 transitions. [2018-12-30 16:04:42,668 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-30 16:04:42,668 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 31 [2018-12-30 16:04:42,668 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 16:04:42,670 INFO L225 Difference]: With dead ends: 304 [2018-12-30 16:04:42,670 INFO L226 Difference]: Without dead ends: 241 [2018-12-30 16:04:42,671 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2018-12-30 16:04:42,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 241 states. [2018-12-30 16:04:42,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 241 to 219. [2018-12-30 16:04:42,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 219 states. [2018-12-30 16:04:42,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 219 states and 307 transitions. [2018-12-30 16:04:42,691 INFO L78 Accepts]: Start accepts. Automaton has 219 states and 307 transitions. Word has length 31 [2018-12-30 16:04:42,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 16:04:42,692 INFO L480 AbstractCegarLoop]: Abstraction has 219 states and 307 transitions. [2018-12-30 16:04:42,692 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-30 16:04:42,692 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 307 transitions. [2018-12-30 16:04:42,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-12-30 16:04:42,693 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 16:04:42,693 INFO L402 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] [2018-12-30 16:04:42,696 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 16:04:42,696 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 16:04:42,696 INFO L82 PathProgramCache]: Analyzing trace with hash -378484437, now seen corresponding path program 1 times [2018-12-30 16:04:42,696 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 16:04:42,696 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 16:04:42,697 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:04:42,697 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 16:04:42,697 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:04:42,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 16:04:42,788 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-30 16:04:42,789 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 16:04:42,789 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-30 16:04:42,789 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-30 16:04:42,789 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-30 16:04:42,789 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 16:04:42,790 INFO L87 Difference]: Start difference. First operand 219 states and 307 transitions. Second operand 3 states. [2018-12-30 16:04:42,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 16:04:42,907 INFO L93 Difference]: Finished difference Result 435 states and 610 transitions. [2018-12-30 16:04:42,908 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-30 16:04:42,908 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 31 [2018-12-30 16:04:42,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 16:04:42,914 INFO L225 Difference]: With dead ends: 435 [2018-12-30 16:04:42,914 INFO L226 Difference]: Without dead ends: 431 [2018-12-30 16:04:42,915 INFO L631 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 [2018-12-30 16:04:42,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 431 states. [2018-12-30 16:04:42,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 431 to 269. [2018-12-30 16:04:42,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 269 states. [2018-12-30 16:04:42,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 269 states to 269 states and 371 transitions. [2018-12-30 16:04:42,943 INFO L78 Accepts]: Start accepts. Automaton has 269 states and 371 transitions. Word has length 31 [2018-12-30 16:04:42,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 16:04:42,943 INFO L480 AbstractCegarLoop]: Abstraction has 269 states and 371 transitions. [2018-12-30 16:04:42,943 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-30 16:04:42,943 INFO L276 IsEmpty]: Start isEmpty. Operand 269 states and 371 transitions. [2018-12-30 16:04:42,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-12-30 16:04:42,946 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 16:04:42,946 INFO L402 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] [2018-12-30 16:04:42,948 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 16:04:42,951 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 16:04:42,951 INFO L82 PathProgramCache]: Analyzing trace with hash -378424855, now seen corresponding path program 1 times [2018-12-30 16:04:42,952 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 16:04:42,952 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 16:04:42,953 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:04:42,954 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 16:04:42,954 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:04:42,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 16:04:43,368 WARN L181 SmtUtils]: Spent 220.00 ms on a formula simplification. DAG size of input: 13 DAG size of output: 7 [2018-12-30 16:04:43,370 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-30 16:04:43,370 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 16:04:43,370 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-30 16:04:43,371 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-30 16:04:43,371 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-30 16:04:43,371 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-30 16:04:43,371 INFO L87 Difference]: Start difference. First operand 269 states and 371 transitions. Second operand 4 states. [2018-12-30 16:04:43,625 WARN L181 SmtUtils]: Spent 123.00 ms on a formula simplification that was a NOOP. DAG size: 11 [2018-12-30 16:04:43,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 16:04:43,659 INFO L93 Difference]: Finished difference Result 315 states and 426 transitions. [2018-12-30 16:04:43,660 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-30 16:04:43,660 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 31 [2018-12-30 16:04:43,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 16:04:43,663 INFO L225 Difference]: With dead ends: 315 [2018-12-30 16:04:43,663 INFO L226 Difference]: Without dead ends: 257 [2018-12-30 16:04:43,663 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-30 16:04:43,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 257 states. [2018-12-30 16:04:43,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 257 to 257. [2018-12-30 16:04:43,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 257 states. [2018-12-30 16:04:43,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 257 states to 257 states and 353 transitions. [2018-12-30 16:04:43,689 INFO L78 Accepts]: Start accepts. Automaton has 257 states and 353 transitions. Word has length 31 [2018-12-30 16:04:43,689 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 16:04:43,689 INFO L480 AbstractCegarLoop]: Abstraction has 257 states and 353 transitions. [2018-12-30 16:04:43,689 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-30 16:04:43,689 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 353 transitions. [2018-12-30 16:04:43,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-12-30 16:04:43,692 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 16:04:43,692 INFO L402 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] [2018-12-30 16:04:43,693 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 16:04:43,693 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 16:04:43,693 INFO L82 PathProgramCache]: Analyzing trace with hash -329006014, now seen corresponding path program 1 times [2018-12-30 16:04:43,693 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 16:04:43,693 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 16:04:43,694 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:04:43,694 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 16:04:43,694 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:04:43,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 16:04:43,855 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-30 16:04:43,855 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 16:04:43,855 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-30 16:04:43,856 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-30 16:04:43,856 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-30 16:04:43,856 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-30 16:04:43,856 INFO L87 Difference]: Start difference. First operand 257 states and 353 transitions. Second operand 4 states. [2018-12-30 16:04:44,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 16:04:44,950 INFO L93 Difference]: Finished difference Result 291 states and 396 transitions. [2018-12-30 16:04:44,950 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-30 16:04:44,950 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 32 [2018-12-30 16:04:44,951 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 16:04:44,952 INFO L225 Difference]: With dead ends: 291 [2018-12-30 16:04:44,952 INFO L226 Difference]: Without dead ends: 245 [2018-12-30 16:04:44,954 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-30 16:04:44,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 245 states. [2018-12-30 16:04:44,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 245 to 245. [2018-12-30 16:04:44,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 245 states. [2018-12-30 16:04:44,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 245 states to 245 states and 337 transitions. [2018-12-30 16:04:44,975 INFO L78 Accepts]: Start accepts. Automaton has 245 states and 337 transitions. Word has length 32 [2018-12-30 16:04:44,976 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 16:04:44,976 INFO L480 AbstractCegarLoop]: Abstraction has 245 states and 337 transitions. [2018-12-30 16:04:44,976 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-30 16:04:44,976 INFO L276 IsEmpty]: Start isEmpty. Operand 245 states and 337 transitions. [2018-12-30 16:04:44,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-12-30 16:04:44,979 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 16:04:44,979 INFO L402 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] [2018-12-30 16:04:44,979 INFO L423 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 16:04:44,980 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 16:04:44,980 INFO L82 PathProgramCache]: Analyzing trace with hash -793600864, now seen corresponding path program 1 times [2018-12-30 16:04:44,980 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 16:04:44,980 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 16:04:44,981 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:04:44,981 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 16:04:44,981 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:04:44,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 16:04:45,092 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-30 16:04:45,093 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 16:04:45,093 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-30 16:04:45,093 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-30 16:04:45,093 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-30 16:04:45,093 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-30 16:04:45,095 INFO L87 Difference]: Start difference. First operand 245 states and 337 transitions. Second operand 4 states. [2018-12-30 16:04:45,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 16:04:45,326 INFO L93 Difference]: Finished difference Result 271 states and 363 transitions. [2018-12-30 16:04:45,327 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-30 16:04:45,327 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 32 [2018-12-30 16:04:45,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 16:04:45,329 INFO L225 Difference]: With dead ends: 271 [2018-12-30 16:04:45,329 INFO L226 Difference]: Without dead ends: 245 [2018-12-30 16:04:45,329 INFO L631 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 [2018-12-30 16:04:45,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 245 states. [2018-12-30 16:04:45,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 245 to 245. [2018-12-30 16:04:45,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 245 states. [2018-12-30 16:04:45,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 245 states to 245 states and 328 transitions. [2018-12-30 16:04:45,353 INFO L78 Accepts]: Start accepts. Automaton has 245 states and 328 transitions. Word has length 32 [2018-12-30 16:04:45,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 16:04:45,353 INFO L480 AbstractCegarLoop]: Abstraction has 245 states and 328 transitions. [2018-12-30 16:04:45,354 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-30 16:04:45,354 INFO L276 IsEmpty]: Start isEmpty. Operand 245 states and 328 transitions. [2018-12-30 16:04:45,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-12-30 16:04:45,357 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 16:04:45,357 INFO L402 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] [2018-12-30 16:04:45,358 INFO L423 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 16:04:45,359 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 16:04:45,359 INFO L82 PathProgramCache]: Analyzing trace with hash -1781478438, now seen corresponding path program 1 times [2018-12-30 16:04:45,359 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 16:04:45,359 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 16:04:45,360 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:04:45,360 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 16:04:45,360 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:04:45,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 16:04:45,432 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-30 16:04:45,432 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 16:04:45,432 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-30 16:04:45,434 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-30 16:04:45,434 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-30 16:04:45,434 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 16:04:45,434 INFO L87 Difference]: Start difference. First operand 245 states and 328 transitions. Second operand 3 states. [2018-12-30 16:04:45,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 16:04:45,941 INFO L93 Difference]: Finished difference Result 356 states and 458 transitions. [2018-12-30 16:04:45,942 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-30 16:04:45,942 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 34 [2018-12-30 16:04:45,942 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 16:04:45,945 INFO L225 Difference]: With dead ends: 356 [2018-12-30 16:04:45,945 INFO L226 Difference]: Without dead ends: 299 [2018-12-30 16:04:45,946 INFO L631 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 [2018-12-30 16:04:45,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 299 states. [2018-12-30 16:04:45,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 299 to 247. [2018-12-30 16:04:45,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 247 states. [2018-12-30 16:04:45,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 247 states to 247 states and 330 transitions. [2018-12-30 16:04:45,972 INFO L78 Accepts]: Start accepts. Automaton has 247 states and 330 transitions. Word has length 34 [2018-12-30 16:04:45,972 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 16:04:45,972 INFO L480 AbstractCegarLoop]: Abstraction has 247 states and 330 transitions. [2018-12-30 16:04:45,972 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-30 16:04:45,972 INFO L276 IsEmpty]: Start isEmpty. Operand 247 states and 330 transitions. [2018-12-30 16:04:45,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-12-30 16:04:45,975 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 16:04:45,976 INFO L402 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] [2018-12-30 16:04:45,976 INFO L423 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 16:04:45,977 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 16:04:45,977 INFO L82 PathProgramCache]: Analyzing trace with hash 1662125936, now seen corresponding path program 1 times [2018-12-30 16:04:45,977 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 16:04:45,977 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 16:04:45,981 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:04:45,981 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 16:04:45,981 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:04:45,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 16:04:46,032 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-30 16:04:46,033 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 16:04:46,033 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-30 16:04:46,033 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-30 16:04:46,033 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-30 16:04:46,033 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 16:04:46,034 INFO L87 Difference]: Start difference. First operand 247 states and 330 transitions. Second operand 3 states. [2018-12-30 16:04:46,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 16:04:46,327 INFO L93 Difference]: Finished difference Result 263 states and 349 transitions. [2018-12-30 16:04:46,328 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-30 16:04:46,328 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 34 [2018-12-30 16:04:46,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 16:04:46,330 INFO L225 Difference]: With dead ends: 263 [2018-12-30 16:04:46,330 INFO L226 Difference]: Without dead ends: 259 [2018-12-30 16:04:46,331 INFO L631 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 [2018-12-30 16:04:46,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 259 states. [2018-12-30 16:04:46,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 259 to 251. [2018-12-30 16:04:46,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 251 states. [2018-12-30 16:04:46,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 251 states to 251 states and 333 transitions. [2018-12-30 16:04:46,360 INFO L78 Accepts]: Start accepts. Automaton has 251 states and 333 transitions. Word has length 34 [2018-12-30 16:04:46,360 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 16:04:46,360 INFO L480 AbstractCegarLoop]: Abstraction has 251 states and 333 transitions. [2018-12-30 16:04:46,360 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-30 16:04:46,360 INFO L276 IsEmpty]: Start isEmpty. Operand 251 states and 333 transitions. [2018-12-30 16:04:46,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-12-30 16:04:46,361 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 16:04:46,361 INFO L402 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] [2018-12-30 16:04:46,362 INFO L423 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 16:04:46,366 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 16:04:46,367 INFO L82 PathProgramCache]: Analyzing trace with hash -822248422, now seen corresponding path program 1 times [2018-12-30 16:04:46,367 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 16:04:46,367 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 16:04:46,369 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:04:46,369 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 16:04:46,370 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:04:46,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 16:04:46,490 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-30 16:04:46,491 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 16:04:46,491 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-30 16:04:46,491 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-30 16:04:46,492 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-30 16:04:46,492 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-30 16:04:46,492 INFO L87 Difference]: Start difference. First operand 251 states and 333 transitions. Second operand 5 states. [2018-12-30 16:04:46,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 16:04:46,739 INFO L93 Difference]: Finished difference Result 304 states and 384 transitions. [2018-12-30 16:04:46,740 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-30 16:04:46,740 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 34 [2018-12-30 16:04:46,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 16:04:46,742 INFO L225 Difference]: With dead ends: 304 [2018-12-30 16:04:46,742 INFO L226 Difference]: Without dead ends: 300 [2018-12-30 16:04:46,743 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-12-30 16:04:46,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 300 states. [2018-12-30 16:04:46,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 300 to 251. [2018-12-30 16:04:46,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 251 states. [2018-12-30 16:04:46,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 251 states to 251 states and 331 transitions. [2018-12-30 16:04:46,775 INFO L78 Accepts]: Start accepts. Automaton has 251 states and 331 transitions. Word has length 34 [2018-12-30 16:04:46,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 16:04:46,776 INFO L480 AbstractCegarLoop]: Abstraction has 251 states and 331 transitions. [2018-12-30 16:04:46,776 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-30 16:04:46,776 INFO L276 IsEmpty]: Start isEmpty. Operand 251 states and 331 transitions. [2018-12-30 16:04:46,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-12-30 16:04:46,777 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 16:04:46,780 INFO L402 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] [2018-12-30 16:04:46,781 INFO L423 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 16:04:46,781 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 16:04:46,781 INFO L82 PathProgramCache]: Analyzing trace with hash 1935189253, now seen corresponding path program 1 times [2018-12-30 16:04:46,781 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 16:04:46,781 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 16:04:46,782 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:04:46,782 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 16:04:46,783 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:04:46,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 16:04:47,440 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-30 16:04:47,440 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 16:04:47,440 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-30 16:04:47,441 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-30 16:04:47,441 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-30 16:04:47,441 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-12-30 16:04:47,442 INFO L87 Difference]: Start difference. First operand 251 states and 331 transitions. Second operand 7 states. [2018-12-30 16:04:47,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 16:04:47,732 INFO L93 Difference]: Finished difference Result 269 states and 351 transitions. [2018-12-30 16:04:47,733 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-30 16:04:47,733 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 34 [2018-12-30 16:04:47,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 16:04:47,735 INFO L225 Difference]: With dead ends: 269 [2018-12-30 16:04:47,735 INFO L226 Difference]: Without dead ends: 250 [2018-12-30 16:04:47,735 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2018-12-30 16:04:47,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 250 states. [2018-12-30 16:04:47,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 250 to 250. [2018-12-30 16:04:47,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 250 states. [2018-12-30 16:04:47,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 329 transitions. [2018-12-30 16:04:47,758 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 329 transitions. Word has length 34 [2018-12-30 16:04:47,758 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 16:04:47,758 INFO L480 AbstractCegarLoop]: Abstraction has 250 states and 329 transitions. [2018-12-30 16:04:47,759 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-30 16:04:47,759 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 329 transitions. [2018-12-30 16:04:47,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-12-30 16:04:47,759 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 16:04:47,762 INFO L402 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] [2018-12-30 16:04:47,763 INFO L423 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 16:04:47,763 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 16:04:47,763 INFO L82 PathProgramCache]: Analyzing trace with hash -21362253, now seen corresponding path program 1 times [2018-12-30 16:04:47,763 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 16:04:47,764 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 16:04:47,764 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:04:47,764 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 16:04:47,765 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:04:47,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 16:04:47,845 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-30 16:04:47,845 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 16:04:47,845 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-30 16:04:47,847 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-30 16:04:47,847 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-30 16:04:47,847 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 16:04:47,847 INFO L87 Difference]: Start difference. First operand 250 states and 329 transitions. Second operand 3 states. [2018-12-30 16:04:47,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 16:04:47,917 INFO L93 Difference]: Finished difference Result 268 states and 349 transitions. [2018-12-30 16:04:47,918 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-30 16:04:47,918 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 35 [2018-12-30 16:04:47,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 16:04:47,919 INFO L225 Difference]: With dead ends: 268 [2018-12-30 16:04:47,919 INFO L226 Difference]: Without dead ends: 231 [2018-12-30 16:04:47,921 INFO L631 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 [2018-12-30 16:04:47,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 231 states. [2018-12-30 16:04:47,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 231 to 231. [2018-12-30 16:04:47,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 231 states. [2018-12-30 16:04:47,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 231 states to 231 states and 303 transitions. [2018-12-30 16:04:47,942 INFO L78 Accepts]: Start accepts. Automaton has 231 states and 303 transitions. Word has length 35 [2018-12-30 16:04:47,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 16:04:47,943 INFO L480 AbstractCegarLoop]: Abstraction has 231 states and 303 transitions. [2018-12-30 16:04:47,943 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-30 16:04:47,943 INFO L276 IsEmpty]: Start isEmpty. Operand 231 states and 303 transitions. [2018-12-30 16:04:47,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-12-30 16:04:47,944 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 16:04:47,944 INFO L402 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] [2018-12-30 16:04:47,944 INFO L423 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 16:04:47,945 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 16:04:47,945 INFO L82 PathProgramCache]: Analyzing trace with hash 272561262, now seen corresponding path program 1 times [2018-12-30 16:04:47,945 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 16:04:47,945 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 16:04:47,946 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:04:47,946 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 16:04:47,946 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:04:47,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 16:04:48,041 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-30 16:04:48,042 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 16:04:48,042 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-30 16:04:48,042 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-30 16:04:48,042 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-30 16:04:48,042 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-30 16:04:48,043 INFO L87 Difference]: Start difference. First operand 231 states and 303 transitions. Second operand 5 states. [2018-12-30 16:04:48,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 16:04:48,405 INFO L93 Difference]: Finished difference Result 289 states and 361 transitions. [2018-12-30 16:04:48,405 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-30 16:04:48,405 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 35 [2018-12-30 16:04:48,405 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 16:04:48,406 INFO L225 Difference]: With dead ends: 289 [2018-12-30 16:04:48,407 INFO L226 Difference]: Without dead ends: 258 [2018-12-30 16:04:48,407 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-12-30 16:04:48,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 258 states. [2018-12-30 16:04:48,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 258 to 231. [2018-12-30 16:04:48,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 231 states. [2018-12-30 16:04:48,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 231 states to 231 states and 297 transitions. [2018-12-30 16:04:48,430 INFO L78 Accepts]: Start accepts. Automaton has 231 states and 297 transitions. Word has length 35 [2018-12-30 16:04:48,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 16:04:48,430 INFO L480 AbstractCegarLoop]: Abstraction has 231 states and 297 transitions. [2018-12-30 16:04:48,430 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-30 16:04:48,430 INFO L276 IsEmpty]: Start isEmpty. Operand 231 states and 297 transitions. [2018-12-30 16:04:48,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-12-30 16:04:48,431 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 16:04:48,431 INFO L402 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] [2018-12-30 16:04:48,432 INFO L423 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 16:04:48,436 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 16:04:48,436 INFO L82 PathProgramCache]: Analyzing trace with hash -2102888975, now seen corresponding path program 1 times [2018-12-30 16:04:48,436 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 16:04:48,436 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 16:04:48,437 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:04:48,437 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 16:04:48,437 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:04:48,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 16:04:48,929 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-30 16:04:48,930 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 16:04:48,930 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-30 16:04:48,930 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-30 16:04:48,930 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-30 16:04:48,930 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-12-30 16:04:48,931 INFO L87 Difference]: Start difference. First operand 231 states and 297 transitions. Second operand 7 states. [2018-12-30 16:04:49,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 16:04:49,793 INFO L93 Difference]: Finished difference Result 255 states and 321 transitions. [2018-12-30 16:04:49,794 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-30 16:04:49,794 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 35 [2018-12-30 16:04:49,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 16:04:49,797 INFO L225 Difference]: With dead ends: 255 [2018-12-30 16:04:49,797 INFO L226 Difference]: Without dead ends: 187 [2018-12-30 16:04:49,798 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2018-12-30 16:04:49,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2018-12-30 16:04:49,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 176. [2018-12-30 16:04:49,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 176 states. [2018-12-30 16:04:49,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 214 transitions. [2018-12-30 16:04:49,817 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 214 transitions. Word has length 35 [2018-12-30 16:04:49,817 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 16:04:49,817 INFO L480 AbstractCegarLoop]: Abstraction has 176 states and 214 transitions. [2018-12-30 16:04:49,817 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-30 16:04:49,817 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 214 transitions. [2018-12-30 16:04:49,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-12-30 16:04:49,818 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 16:04:49,818 INFO L402 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] [2018-12-30 16:04:49,818 INFO L423 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 16:04:49,821 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 16:04:49,822 INFO L82 PathProgramCache]: Analyzing trace with hash 1804254012, now seen corresponding path program 1 times [2018-12-30 16:04:49,822 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 16:04:49,824 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 16:04:49,825 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:04:49,825 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 16:04:49,826 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:04:49,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 16:04:50,551 WARN L181 SmtUtils]: Spent 247.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 5 [2018-12-30 16:04:50,553 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-30 16:04:50,554 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 16:04:50,554 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-30 16:04:50,554 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-30 16:04:50,554 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-30 16:04:50,555 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-30 16:04:50,555 INFO L87 Difference]: Start difference. First operand 176 states and 214 transitions. Second operand 6 states. [2018-12-30 16:04:50,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 16:04:50,738 INFO L93 Difference]: Finished difference Result 187 states and 225 transitions. [2018-12-30 16:04:50,739 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-30 16:04:50,739 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 35 [2018-12-30 16:04:50,739 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 16:04:50,740 INFO L225 Difference]: With dead ends: 187 [2018-12-30 16:04:50,740 INFO L226 Difference]: Without dead ends: 155 [2018-12-30 16:04:50,741 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-12-30 16:04:50,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2018-12-30 16:04:50,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 155. [2018-12-30 16:04:50,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 155 states. [2018-12-30 16:04:50,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 184 transitions. [2018-12-30 16:04:50,757 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 184 transitions. Word has length 35 [2018-12-30 16:04:50,757 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 16:04:50,757 INFO L480 AbstractCegarLoop]: Abstraction has 155 states and 184 transitions. [2018-12-30 16:04:50,757 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-30 16:04:50,757 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 184 transitions. [2018-12-30 16:04:50,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-12-30 16:04:50,758 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 16:04:50,758 INFO L402 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] [2018-12-30 16:04:50,759 INFO L423 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 16:04:50,759 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 16:04:50,759 INFO L82 PathProgramCache]: Analyzing trace with hash -1398430965, now seen corresponding path program 1 times [2018-12-30 16:04:50,759 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 16:04:50,759 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 16:04:50,760 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:04:50,760 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 16:04:50,760 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:04:50,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 16:04:50,857 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-30 16:04:50,857 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 16:04:50,857 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-30 16:04:50,857 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-30 16:04:50,858 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-30 16:04:50,858 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-12-30 16:04:50,858 INFO L87 Difference]: Start difference. First operand 155 states and 184 transitions. Second operand 7 states. [2018-12-30 16:04:51,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 16:04:51,072 INFO L93 Difference]: Finished difference Result 193 states and 224 transitions. [2018-12-30 16:04:51,073 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-30 16:04:51,073 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 36 [2018-12-30 16:04:51,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 16:04:51,075 INFO L225 Difference]: With dead ends: 193 [2018-12-30 16:04:51,075 INFO L226 Difference]: Without dead ends: 173 [2018-12-30 16:04:51,077 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2018-12-30 16:04:51,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2018-12-30 16:04:51,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 154. [2018-12-30 16:04:51,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 154 states. [2018-12-30 16:04:51,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 182 transitions. [2018-12-30 16:04:51,094 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 182 transitions. Word has length 36 [2018-12-30 16:04:51,094 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 16:04:51,094 INFO L480 AbstractCegarLoop]: Abstraction has 154 states and 182 transitions. [2018-12-30 16:04:51,095 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-30 16:04:51,095 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 182 transitions. [2018-12-30 16:04:51,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-12-30 16:04:51,098 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 16:04:51,098 INFO L402 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] [2018-12-30 16:04:51,099 INFO L423 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 16:04:51,099 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 16:04:51,099 INFO L82 PathProgramCache]: Analyzing trace with hash 287352256, now seen corresponding path program 1 times [2018-12-30 16:04:51,099 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 16:04:51,099 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 16:04:51,104 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:04:51,105 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 16:04:51,105 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:04:51,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 16:04:51,238 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-30 16:04:51,239 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 16:04:51,239 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-30 16:04:51,239 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-30 16:04:51,239 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-30 16:04:51,240 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-30 16:04:51,240 INFO L87 Difference]: Start difference. First operand 154 states and 182 transitions. Second operand 4 states. [2018-12-30 16:04:51,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 16:04:51,425 INFO L93 Difference]: Finished difference Result 173 states and 201 transitions. [2018-12-30 16:04:51,426 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-30 16:04:51,426 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 37 [2018-12-30 16:04:51,427 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 16:04:51,428 INFO L225 Difference]: With dead ends: 173 [2018-12-30 16:04:51,428 INFO L226 Difference]: Without dead ends: 150 [2018-12-30 16:04:51,429 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-30 16:04:51,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2018-12-30 16:04:51,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 146. [2018-12-30 16:04:51,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states. [2018-12-30 16:04:51,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 170 transitions. [2018-12-30 16:04:51,448 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 170 transitions. Word has length 37 [2018-12-30 16:04:51,448 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 16:04:51,448 INFO L480 AbstractCegarLoop]: Abstraction has 146 states and 170 transitions. [2018-12-30 16:04:51,448 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-30 16:04:51,448 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 170 transitions. [2018-12-30 16:04:51,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-12-30 16:04:51,452 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 16:04:51,452 INFO L402 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] [2018-12-30 16:04:51,452 INFO L423 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 16:04:51,455 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 16:04:51,455 INFO L82 PathProgramCache]: Analyzing trace with hash 724480386, now seen corresponding path program 1 times [2018-12-30 16:04:51,455 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 16:04:51,455 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 16:04:51,457 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:04:51,458 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 16:04:51,458 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:04:51,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-30 16:04:51,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-30 16:04:51,514 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2018-12-30 16:04:51,633 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 30.12 04:04:51 BoogieIcfgContainer [2018-12-30 16:04:51,633 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-30 16:04:51,635 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-30 16:04:51,636 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-30 16:04:51,636 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-30 16:04:51,637 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.12 04:04:32" (3/4) ... [2018-12-30 16:04:51,641 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2018-12-30 16:04:51,788 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2018-12-30 16:04:51,788 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-30 16:04:51,789 INFO L168 Benchmark]: Toolchain (without parser) took 23059.87 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 288.4 MB). Free memory was 954.0 MB in the beginning and 948.7 MB in the end (delta: 5.4 MB). Peak memory consumption was 293.7 MB. Max. memory is 11.5 GB. [2018-12-30 16:04:51,791 INFO L168 Benchmark]: CDTParser took 0.13 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-30 16:04:51,791 INFO L168 Benchmark]: CACSL2BoogieTranslator took 664.53 ms. Allocated memory is still 1.0 GB. Free memory was 954.0 MB in the beginning and 931.2 MB in the end (delta: 22.8 MB). Peak memory consumption was 22.8 MB. Max. memory is 11.5 GB. [2018-12-30 16:04:51,792 INFO L168 Benchmark]: Boogie Procedure Inliner took 249.10 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 111.7 MB). Free memory was 931.2 MB in the beginning and 1.1 GB in the end (delta: -167.7 MB). Peak memory consumption was 14.2 MB. Max. memory is 11.5 GB. [2018-12-30 16:04:51,792 INFO L168 Benchmark]: Boogie Preprocessor took 109.60 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 7.0 MB). Peak memory consumption was 7.0 MB. Max. memory is 11.5 GB. [2018-12-30 16:04:51,794 INFO L168 Benchmark]: RCFGBuilder took 2613.09 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 988.7 MB in the end (delta: 103.3 MB). Peak memory consumption was 103.3 MB. Max. memory is 11.5 GB. [2018-12-30 16:04:51,795 INFO L168 Benchmark]: TraceAbstraction took 19262.89 ms. Allocated memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: 176.7 MB). Free memory was 988.7 MB in the beginning and 968.1 MB in the end (delta: 20.6 MB). Peak memory consumption was 197.3 MB. Max. memory is 11.5 GB. [2018-12-30 16:04:51,795 INFO L168 Benchmark]: Witness Printer took 153.46 ms. Allocated memory is still 1.3 GB. Free memory was 968.1 MB in the beginning and 948.7 MB in the end (delta: 19.4 MB). Peak memory consumption was 19.4 MB. Max. memory is 11.5 GB. [2018-12-30 16:04:51,799 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.13 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 664.53 ms. Allocated memory is still 1.0 GB. Free memory was 954.0 MB in the beginning and 931.2 MB in the end (delta: 22.8 MB). Peak memory consumption was 22.8 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 249.10 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 111.7 MB). Free memory was 931.2 MB in the beginning and 1.1 GB in the end (delta: -167.7 MB). Peak memory consumption was 14.2 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 109.60 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 7.0 MB). Peak memory consumption was 7.0 MB. Max. memory is 11.5 GB. * RCFGBuilder took 2613.09 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 988.7 MB in the end (delta: 103.3 MB). Peak memory consumption was 103.3 MB. Max. memory is 11.5 GB. * TraceAbstraction took 19262.89 ms. Allocated memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: 176.7 MB). Free memory was 988.7 MB in the beginning and 968.1 MB in the end (delta: 20.6 MB). Peak memory consumption was 197.3 MB. Max. memory is 11.5 GB. * Witness Printer took 153.46 ms. Allocated memory is still 1.3 GB. Free memory was 968.1 MB in the beginning and 948.7 MB in the end (delta: 19.4 MB). Peak memory consumption was 19.4 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 1012]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L22] int KernelMode ; [L23] int Executive ; [L24] int DevicePowerState ; [L25] int s ; [L26] int UNLOADED ; [L27] int NP ; [L28] int DC ; [L29] int SKIP1 ; [L30] int SKIP2 ; [L31] int MPR1 ; [L32] int MPR3 ; [L33] int IPC ; [L34] int pended ; [L35] int compFptr ; [L36] int compRegistered ; [L37] int lowerDriverReturn ; [L38] int setEventCalled ; [L39] int customIrp ; [L40] 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] [L293] int status ; [L294] int irp = __VERIFIER_nondet_int() ; [L295] int pirp ; [L296] int pirp__IoStatus__Status ; [L297] int irp_choice = __VERIFIER_nondet_int() ; [L298] int devobj = __VERIFIER_nondet_int() ; [L299] int __cil_tmp8 ; [L301] KernelMode = 0 [L302] Executive = 0 [L303] DevicePowerState = 1 [L304] s = 0 [L305] UNLOADED = 0 [L306] NP = 0 [L307] DC = 0 [L308] SKIP1 = 0 [L309] SKIP2 = 0 [L310] MPR1 = 0 [L311] MPR3 = 0 [L312] IPC = 0 [L313] pended = 0 [L314] compFptr = 0 [L315] compRegistered = 0 [L316] lowerDriverReturn = 0 [L317] setEventCalled = 0 [L318] customIrp = 0 [L319] myStatus = 0 [L323] status = 0 [L324] pirp = irp [L60] UNLOADED = 0 [L61] NP = 1 [L62] DC = 2 [L63] SKIP1 = 3 [L64] SKIP2 = 4 [L65] MPR1 = 5 [L66] MPR3 = 6 [L67] IPC = 7 [L68] s = UNLOADED [L69] pended = 0 [L70] compFptr = 0 [L71] compRegistered = 0 [L72] lowerDriverReturn = 0 [L73] setEventCalled = 0 [L74] 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] [L327] COND TRUE status >= 0 [L328] s = NP [L329] customIrp = 0 [L330] setEventCalled = customIrp [L331] lowerDriverReturn = setEventCalled [L332] compRegistered = lowerDriverReturn [L333] pended = compRegistered [L334] pirp__IoStatus__Status = 0 [L335] 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] [L336] COND TRUE irp_choice == 0 [L337] pirp__IoStatus__Status = -1073741637 [L338] 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] [L46] s = NP [L47] pended = 0 [L48] compFptr = 0 [L49] compRegistered = 0 [L50] lowerDriverReturn = 0 [L51] setEventCalled = 0 [L52] 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] [L344] COND FALSE !(status < 0) [L348] int tmp_ndt_1; [L349] tmp_ndt_1 = __VERIFIER_nondet_int() [L350] COND FALSE !(tmp_ndt_1 == 0) [L353] int tmp_ndt_2; [L354] tmp_ndt_2 = __VERIFIER_nondet_int() [L355] COND FALSE !(tmp_ndt_2 == 1) [L358] int tmp_ndt_3; [L359] tmp_ndt_3 = __VERIFIER_nondet_int() [L360] 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] [L79] int devExt ; [L80] int irpStack ; [L81] int status ; [L82] int event = __VERIFIER_nondet_int() ; [L83] int DeviceObject__DeviceExtension = __VERIFIER_nondet_int() ; [L84] int Irp__Tail__Overlay__CurrentStackLocation = __VERIFIER_nondet_int() ; [L85] int irpStack__MinorFunction = __VERIFIER_nondet_int() ; [L86] int devExt__TopOfStack = __VERIFIER_nondet_int() ; [L87] int devExt__Started ; [L88] int devExt__Removed ; [L89] int devExt__SurpriseRemoved ; [L90] int Irp__IoStatus__Status ; [L91] int Irp__IoStatus__Information ; [L92] int Irp__CurrentLocation = __VERIFIER_nondet_int() ; [L93] int irpSp ; [L94] int nextIrpSp ; [L95] int nextIrpSp__Control ; [L96] int irpSp___0 ; [L97] int irpSp__Context ; [L98] int irpSp__Control ; [L99] long __cil_tmp23 ; [L102] status = 0 [L103] devExt = DeviceObject__DeviceExtension [L104] 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] [L105] 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] [L108] 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] [L111] 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] [L235] 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] [L236] COND TRUE s == NP [L237] 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] [L244] Irp__CurrentLocation ++ [L245] Irp__Tail__Overlay__CurrentStackLocation ++ [L482] int returnVal2 ; [L483] int compRetStatus ; [L484] int lcontext = __VERIFIER_nondet_int() ; [L485] 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] [L488] 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] [L501] int tmp_ndt_6; [L502] tmp_ndt_6 = __VERIFIER_nondet_int() [L503] COND FALSE !(tmp_ndt_6 == 0) [L506] int tmp_ndt_7; [L507] tmp_ndt_7 = __VERIFIER_nondet_int() [L508] 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] [L517] 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] [L527] 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] [L531] 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] [L540] COND TRUE s == SKIP1 [L541] s = SKIP2 [L542] 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] [L550] 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] [L247] 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] [L289] 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] [L387] status = KbFilter_PnP(devobj, pirp) [L411] 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] [L419] 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] [L427] 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] [L428] 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] [L429] 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] [L439] 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] [L446] 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] [L451] 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] [L1012] __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, 354 locations, 30 error locations. UNSAFE Result, 19.1s OverallTime, 26 OverallIterations, 1 TraceHistogramMax, 12.8s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 7074 SDtfs, 4131 SDslu, 10093 SDs, 0 SdLazy, 1967 SolverSat, 277 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 9.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 142 GetRequests, 52 SyntacticMatches, 1 SemanticMatches, 89 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 5.2s 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 AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.6s AutomataMinimizationTime, 25 MinimizatonAttempts, 583 StatesRemovedByMinimization, 15 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 4.5s InterpolantComputationTime, 770 NumberOfCodeBlocks, 770 NumberOfCodeBlocksAsserted, 26 NumberOfCheckSat, 708 ConstructedInterpolants, 0 QuantifiedInterpolants, 45924 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 25 InterpolantComputations, 25 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...